./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4401c8d858d7e27d3ac20a1c2254173b907c9ae63c734789626e79fce7633b83 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:27:53,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:27:53,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:27:53,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:27:53,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:27:53,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:27:53,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:27:53,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:27:53,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:27:53,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:27:53,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:27:53,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:27:53,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:27:53,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:27:53,191 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:27:53,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:27:53,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:27:53,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:27:53,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:27:53,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:27:53,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:27:53,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:27:53,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:27:53,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:27:53,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:27:53,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:27:53,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:27:53,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:27:53,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:27:53,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:27:53,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:27:53,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:27:53,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:27:53,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:27:53,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:27:53,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:27:53,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:27:53,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:27:53,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:27:53,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:27:53,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:27:53,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:27:53,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4401c8d858d7e27d3ac20a1c2254173b907c9ae63c734789626e79fce7633b83 [2024-11-16 18:27:53,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:27:53,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:27:53,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:27:53,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:27:53,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:27:53,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:27:54,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:27:55,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:27:55,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:27:55,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca8810c0/7764730783ce4873876ad56c5dfeda69/FLAGe7edcf77f [2024-11-16 18:27:55,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca8810c0/7764730783ce4873876ad56c5dfeda69 [2024-11-16 18:27:55,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:27:55,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:27:55,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:27:55,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:27:55,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:27:55,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302ec344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55, skipping insertion in model container [2024-11-16 18:27:55,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:27:55,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i[917,930] [2024-11-16 18:27:55,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:27:55,606 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:27:55,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i[917,930] [2024-11-16 18:27:55,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:27:55,697 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:27:55,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55 WrapperNode [2024-11-16 18:27:55,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:27:55,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:27:55,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:27:55,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:27:55,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,763 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2024-11-16 18:27:55,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:27:55,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:27:55,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:27:55,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:27:55,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,811 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2024-11-16 18:27:55,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:27:55,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:27:55,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:27:55,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:27:55,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (1/1) ... [2024-11-16 18:27:55,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:27:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:27:55,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:27:55,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:27:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:27:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:27:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-16 18:27:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:27:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:27:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-16 18:27:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:27:55,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 18:27:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:27:55,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:27:56,150 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:27:56,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:27:56,639 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-16 18:27:56,706 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-16 18:27:56,706 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:27:56,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:27:56,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:27:56,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:27:56 BoogieIcfgContainer [2024-11-16 18:27:56,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:27:56,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:27:56,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:27:56,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:27:56,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:27:55" (1/3) ... [2024-11-16 18:27:56,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9798c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:27:56, skipping insertion in model container [2024-11-16 18:27:56,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:27:55" (2/3) ... [2024-11-16 18:27:56,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9798c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:27:56, skipping insertion in model container [2024-11-16 18:27:56,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:27:56" (3/3) ... [2024-11-16 18:27:56,772 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:27:56,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:27:56,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:27:56,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:27:56,896 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;@5c55b41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:27:56,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:27:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 102 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:27:56,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:56,912 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:56,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 447033650, now seen corresponding path program 1 times [2024-11-16 18:27:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212556302] [2024-11-16 18:27:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:57,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212556302] [2024-11-16 18:27:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212556302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:27:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660031328] [2024-11-16 18:27:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:27:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:27:57,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:27:57,351 INFO L87 Difference]: Start difference. First operand has 115 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 102 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:27:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:57,389 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2024-11-16 18:27:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:27:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-16 18:27:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:57,398 INFO L225 Difference]: With dead ends: 222 [2024-11-16 18:27:57,398 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 18:27:57,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:27:57,405 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:57,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:27:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 18:27:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-16 18:27:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-16 18:27:57,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 108 [2024-11-16 18:27:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:57,458 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-16 18:27:57,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:27:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-16 18:27:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:27:57,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:57,466 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:27:57,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1555175593, now seen corresponding path program 1 times [2024-11-16 18:27:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783794673] [2024-11-16 18:27:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783794673] [2024-11-16 18:27:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783794673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:27:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632921748] [2024-11-16 18:27:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:57,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:27:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:27:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:57,989 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:58,050 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-11-16 18:27:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:27:58,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-16 18:27:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:58,055 INFO L225 Difference]: With dead ends: 220 [2024-11-16 18:27:58,055 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 18:27:58,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,057 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:58,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:27:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 18:27:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-16 18:27:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-16 18:27:58,075 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 108 [2024-11-16 18:27:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-16 18:27:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-16 18:27:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:27:58,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:58,079 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:58,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:27:58,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:58,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1358662088, now seen corresponding path program 1 times [2024-11-16 18:27:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068256358] [2024-11-16 18:27:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068256358] [2024-11-16 18:27:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068256358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:27:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308175573] [2024-11-16 18:27:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:58,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:27:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:27:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,335 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:58,376 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2024-11-16 18:27:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:27:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-16 18:27:58,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:58,379 INFO L225 Difference]: With dead ends: 224 [2024-11-16 18:27:58,380 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 18:27:58,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,383 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:58,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:27:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 18:27:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-16 18:27:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-16 18:27:58,400 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 108 [2024-11-16 18:27:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:58,400 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-16 18:27:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-16 18:27:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:27:58,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:58,403 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:27:58,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1193494873, now seen corresponding path program 1 times [2024-11-16 18:27:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:58,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946363116] [2024-11-16 18:27:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946363116] [2024-11-16 18:27:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946363116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:58,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:27:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953790297] [2024-11-16 18:27:58,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:58,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:27:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:27:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,605 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:58,642 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2024-11-16 18:27:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:27:58,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-16 18:27:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:58,644 INFO L225 Difference]: With dead ends: 228 [2024-11-16 18:27:58,644 INFO L226 Difference]: Without dead ends: 117 [2024-11-16 18:27:58,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,646 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:58,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:27:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-16 18:27:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-16 18:27:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-16 18:27:58,655 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 108 [2024-11-16 18:27:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:58,655 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-16 18:27:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-16 18:27:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:27:58,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:58,658 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:27:58,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:58,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1164865722, now seen corresponding path program 1 times [2024-11-16 18:27:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664485005] [2024-11-16 18:27:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:58,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664485005] [2024-11-16 18:27:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664485005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:27:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298562534] [2024-11-16 18:27:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:27:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:27:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:27:58,931 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:58,998 INFO L93 Difference]: Finished difference Result 269 states and 375 transitions. [2024-11-16 18:27:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:27:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-16 18:27:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:59,002 INFO L225 Difference]: With dead ends: 269 [2024-11-16 18:27:59,002 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 18:27:59,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:27:59,005 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 150 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:59,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 453 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:27:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 18:27:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 116. [2024-11-16 18:27:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2024-11-16 18:27:59,014 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 108 [2024-11-16 18:27:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:59,015 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2024-11-16 18:27:59,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2024-11-16 18:27:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 18:27:59,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:59,017 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:59,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:27:59,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:59,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1437003902, now seen corresponding path program 1 times [2024-11-16 18:27:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867434729] [2024-11-16 18:27:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:27:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:27:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:27:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:27:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:27:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:27:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:27:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867434729] [2024-11-16 18:27:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867434729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:27:59,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:27:59,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:27:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551338287] [2024-11-16 18:27:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:27:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:27:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:27:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:27:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:27:59,321 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:27:59,404 INFO L93 Difference]: Finished difference Result 231 states and 320 transitions. [2024-11-16 18:27:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:27:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-16 18:27:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:27:59,406 INFO L225 Difference]: With dead ends: 231 [2024-11-16 18:27:59,407 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 18:27:59,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:27:59,408 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:27:59,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:27:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 18:27:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-16 18:27:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:27:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-16 18:27:59,423 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 109 [2024-11-16 18:27:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:27:59,424 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-16 18:27:59,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:27:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-16 18:27:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:27:59,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:27:59,428 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:27:59,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:27:59,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:27:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:27:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 872365449, now seen corresponding path program 1 times [2024-11-16 18:27:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:27:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712537663] [2024-11-16 18:27:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:27:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:27:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:27:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:27:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:27:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:27:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:27:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:27:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:27:59,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712537663] [2024-11-16 18:28:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712537663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:00,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175436131] [2024-11-16 18:28:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:28:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:28:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:00,040 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:28:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:00,340 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2024-11-16 18:28:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-16 18:28:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:00,343 INFO L225 Difference]: With dead ends: 273 [2024-11-16 18:28:00,343 INFO L226 Difference]: Without dead ends: 158 [2024-11-16 18:28:00,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:28:00,344 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 361 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:00,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 357 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:28:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-16 18:28:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2024-11-16 18:28:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:28:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2024-11-16 18:28:00,364 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 110 [2024-11-16 18:28:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:00,364 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2024-11-16 18:28:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:28:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2024-11-16 18:28:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:00,369 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:28:00,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 298411691, now seen corresponding path program 1 times [2024-11-16 18:28:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912080647] [2024-11-16 18:28:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363324893] [2024-11-16 18:28:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:00,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:00,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:00,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:00,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:28:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:00,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:28:00,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:00,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 18:28:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:01,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912080647] [2024-11-16 18:28:01,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:01,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363324893] [2024-11-16 18:28:01,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363324893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:01,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:28:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066789354] [2024-11-16 18:28:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:28:01,014 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:01,117 INFO L93 Difference]: Finished difference Result 314 states and 430 transitions. [2024-11-16 18:28:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-16 18:28:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:01,119 INFO L225 Difference]: With dead ends: 314 [2024-11-16 18:28:01,119 INFO L226 Difference]: Without dead ends: 199 [2024-11-16 18:28:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:01,120 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 103 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 527 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-16 18:28:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2024-11-16 18:28:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 177 states have (on average 1.344632768361582) internal successors, (238), 178 states have internal predecessors, (238), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:28:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2024-11-16 18:28:01,141 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 110 [2024-11-16 18:28:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:01,141 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2024-11-16 18:28:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2024-11-16 18:28:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:01,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:01,143 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:01,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:28:01,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:01,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:01,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -698660662, now seen corresponding path program 1 times [2024-11-16 18:28:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701036547] [2024-11-16 18:28:01,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922891691] [2024-11-16 18:28:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:01,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:01,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:01,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:28:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:01,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:28:01,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:01,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701036547] [2024-11-16 18:28:01,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922891691] [2024-11-16 18:28:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922891691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946671356] [2024-11-16 18:28:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:01,935 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:02,279 INFO L93 Difference]: Finished difference Result 629 states and 862 transitions. [2024-11-16 18:28:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:02,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-16 18:28:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:02,283 INFO L225 Difference]: With dead ends: 629 [2024-11-16 18:28:02,284 INFO L226 Difference]: Without dead ends: 437 [2024-11-16 18:28:02,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:28:02,285 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 236 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:02,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 836 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:28:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-16 18:28:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 245. [2024-11-16 18:28:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.3271028037383177) internal successors, (284), 215 states have internal predecessors, (284), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2024-11-16 18:28:02,311 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 110 [2024-11-16 18:28:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2024-11-16 18:28:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2024-11-16 18:28:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:02,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:02,315 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:02,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 18:28:02,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -687344535, now seen corresponding path program 1 times [2024-11-16 18:28:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415536785] [2024-11-16 18:28:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415536785] [2024-11-16 18:28:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415536785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:28:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465072954] [2024-11-16 18:28:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:03,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:28:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:28:03,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:28:03,784 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:28:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:04,623 INFO L93 Difference]: Finished difference Result 586 states and 806 transitions. [2024-11-16 18:28:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:28:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2024-11-16 18:28:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:04,628 INFO L225 Difference]: With dead ends: 586 [2024-11-16 18:28:04,628 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 18:28:04,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:04,630 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 478 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:04,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 866 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:28:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 18:28:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 277. [2024-11-16 18:28:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 246 states have (on average 1.3414634146341464) internal successors, (330), 247 states have internal predecessors, (330), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 382 transitions. [2024-11-16 18:28:04,656 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 382 transitions. Word has length 110 [2024-11-16 18:28:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:04,657 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 382 transitions. [2024-11-16 18:28:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:28:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 382 transitions. [2024-11-16 18:28:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:04,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:04,658 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:04,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:28:04,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash 665965162, now seen corresponding path program 1 times [2024-11-16 18:28:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657415718] [2024-11-16 18:28:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657415718] [2024-11-16 18:28:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657415718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:05,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:05,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:28:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450641559] [2024-11-16 18:28:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:05,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:28:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:05,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:28:05,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:28:05,611 INFO L87 Difference]: Start difference. First operand 277 states and 382 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:28:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:06,082 INFO L93 Difference]: Finished difference Result 687 states and 948 transitions. [2024-11-16 18:28:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2024-11-16 18:28:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:06,085 INFO L225 Difference]: With dead ends: 687 [2024-11-16 18:28:06,085 INFO L226 Difference]: Without dead ends: 463 [2024-11-16 18:28:06,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:28:06,086 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 278 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:06,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1013 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:28:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-16 18:28:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2024-11-16 18:28:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 413 states have (on average 1.341404358353511) internal successors, (554), 416 states have internal predecessors, (554), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 18:28:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 632 transitions. [2024-11-16 18:28:06,126 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 632 transitions. Word has length 110 [2024-11-16 18:28:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 632 transitions. [2024-11-16 18:28:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:28:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 632 transitions. [2024-11-16 18:28:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:06,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:06,129 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:06,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:28:06,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:06,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1380446232, now seen corresponding path program 1 times [2024-11-16 18:28:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537453300] [2024-11-16 18:28:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537453300] [2024-11-16 18:28:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537453300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600932791] [2024-11-16 18:28:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:28:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:28:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:06,499 INFO L87 Difference]: Start difference. First operand 459 states and 632 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:06,683 INFO L93 Difference]: Finished difference Result 1039 states and 1433 transitions. [2024-11-16 18:28:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:28:06,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-16 18:28:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:06,688 INFO L225 Difference]: With dead ends: 1039 [2024-11-16 18:28:06,688 INFO L226 Difference]: Without dead ends: 636 [2024-11-16 18:28:06,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:28:06,689 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 111 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:06,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 997 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-16 18:28:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2024-11-16 18:28:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 574 states have (on average 1.3449477351916377) internal successors, (772), 579 states have internal predecessors, (772), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 870 transitions. [2024-11-16 18:28:06,734 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 870 transitions. Word has length 110 [2024-11-16 18:28:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 870 transitions. [2024-11-16 18:28:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 870 transitions. [2024-11-16 18:28:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:28:06,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:06,737 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:06,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:28:06,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -27136535, now seen corresponding path program 1 times [2024-11-16 18:28:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683044856] [2024-11-16 18:28:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-16 18:28:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683044856] [2024-11-16 18:28:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683044856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649499231] [2024-11-16 18:28:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:08,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 18:28:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:09,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 18:28:09,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:09,841 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 40 treesize of output 39 [2024-11-16 18:28:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-16 18:28:10,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:10,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2024-11-16 18:28:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:10,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649499231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2024-11-16 18:28:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426566215] [2024-11-16 18:28:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:10,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:28:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:28:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:28:10,216 INFO L87 Difference]: Start difference. First operand 632 states and 870 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:10,952 INFO L93 Difference]: Finished difference Result 1336 states and 1839 transitions. [2024-11-16 18:28:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-16 18:28:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:10,957 INFO L225 Difference]: With dead ends: 1336 [2024-11-16 18:28:10,957 INFO L226 Difference]: Without dead ends: 760 [2024-11-16 18:28:10,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2024-11-16 18:28:10,961 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 197 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:10,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1051 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:28:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-16 18:28:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 663. [2024-11-16 18:28:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 605 states have (on average 1.3487603305785123) internal successors, (816), 610 states have internal predecessors, (816), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 914 transitions. [2024-11-16 18:28:11,006 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 914 transitions. Word has length 110 [2024-11-16 18:28:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:11,007 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 914 transitions. [2024-11-16 18:28:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 914 transitions. [2024-11-16 18:28:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 18:28:11,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:11,009 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:11,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:11,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:11,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:11,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:11,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1837697668, now seen corresponding path program 1 times [2024-11-16 18:28:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730839422] [2024-11-16 18:28:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228587169] [2024-11-16 18:28:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:11,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:11,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:11,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 18:28:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:11,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:28:11,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:11,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:11,763 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 17 treesize of output 22 [2024-11-16 18:28:11,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 18:28:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:11,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:11,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730839422] [2024-11-16 18:28:11,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228587169] [2024-11-16 18:28:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228587169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:11,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:11,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801928834] [2024-11-16 18:28:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:11,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:28:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:28:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:11,841 INFO L87 Difference]: Start difference. First operand 663 states and 914 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:11,951 INFO L93 Difference]: Finished difference Result 1520 states and 2098 transitions. [2024-11-16 18:28:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:28:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-16 18:28:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:11,956 INFO L225 Difference]: With dead ends: 1520 [2024-11-16 18:28:11,956 INFO L226 Difference]: Without dead ends: 913 [2024-11-16 18:28:11,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:11,958 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 98 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 657 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:11,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 657 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-11-16 18:28:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 663. [2024-11-16 18:28:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 605 states have (on average 1.3487603305785123) internal successors, (816), 610 states have internal predecessors, (816), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 914 transitions. [2024-11-16 18:28:12,000 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 914 transitions. Word has length 111 [2024-11-16 18:28:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:12,001 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 914 transitions. [2024-11-16 18:28:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 914 transitions. [2024-11-16 18:28:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 18:28:12,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:12,003 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:12,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 18:28:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:12,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 840625315, now seen corresponding path program 1 times [2024-11-16 18:28:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884898338] [2024-11-16 18:28:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443460647] [2024-11-16 18:28:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:12,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:12,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:12,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:12,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 18:28:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:12,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 18:28:12,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:12,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:13,100 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 18:28:13,101 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 15 treesize of output 15 [2024-11-16 18:28:13,258 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 18:28:13,259 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 [2024-11-16 18:28:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-16 18:28:13,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884898338] [2024-11-16 18:28:13,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443460647] [2024-11-16 18:28:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443460647] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-16 18:28:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117286640] [2024-11-16 18:28:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:28:13,442 INFO L87 Difference]: Start difference. First operand 663 states and 914 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:13,598 INFO L93 Difference]: Finished difference Result 1451 states and 1994 transitions. [2024-11-16 18:28:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2024-11-16 18:28:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:13,602 INFO L225 Difference]: With dead ends: 1451 [2024-11-16 18:28:13,603 INFO L226 Difference]: Without dead ends: 842 [2024-11-16 18:28:13,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:28:13,605 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:13,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 628 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-16 18:28:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 657. [2024-11-16 18:28:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 599 states have (on average 1.342237061769616) internal successors, (804), 604 states have internal predecessors, (804), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 902 transitions. [2024-11-16 18:28:13,645 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 902 transitions. Word has length 111 [2024-11-16 18:28:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:13,646 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 902 transitions. [2024-11-16 18:28:13,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 902 transitions. [2024-11-16 18:28:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:28:13,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:13,648 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:13,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 18:28:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 18:28:13,849 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1265054743, now seen corresponding path program 1 times [2024-11-16 18:28:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883747995] [2024-11-16 18:28:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:13,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593664066] [2024-11-16 18:28:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:13,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 18:28:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:14,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-16 18:28:14,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:15,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:15,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:15,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-11-16 18:28:16,102 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 18:28:16,103 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 15 treesize of output 15 [2024-11-16 18:28:16,266 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 41 treesize of output 36 [2024-11-16 18:28:16,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-16 18:28:16,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:16,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2024-11-16 18:28:16,580 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 18:28:16,580 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 38 treesize of output 22 [2024-11-16 18:28:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:28:16,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883747995] [2024-11-16 18:28:17,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593664066] [2024-11-16 18:28:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593664066] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-16 18:28:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223183827] [2024-11-16 18:28:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:17,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:17,078 INFO L87 Difference]: Start difference. First operand 657 states and 902 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:17,735 INFO L93 Difference]: Finished difference Result 1351 states and 1853 transitions. [2024-11-16 18:28:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:28:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-16 18:28:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:17,739 INFO L225 Difference]: With dead ends: 1351 [2024-11-16 18:28:17,740 INFO L226 Difference]: Without dead ends: 750 [2024-11-16 18:28:17,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:28:17,742 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 151 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:17,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 757 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:28:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-16 18:28:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 657. [2024-11-16 18:28:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 599 states have (on average 1.342237061769616) internal successors, (804), 604 states have internal predecessors, (804), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 902 transitions. [2024-11-16 18:28:17,781 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 902 transitions. Word has length 112 [2024-11-16 18:28:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:17,781 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 902 transitions. [2024-11-16 18:28:17,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 902 transitions. [2024-11-16 18:28:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:28:17,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:17,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:17,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 18:28:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 18:28:17,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash -262544983, now seen corresponding path program 1 times [2024-11-16 18:28:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871129436] [2024-11-16 18:28:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186706140] [2024-11-16 18:28:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:18,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:18,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 18:28:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:18,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-16 18:28:18,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:18,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:19,358 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 8 treesize of output 1 [2024-11-16 18:28:19,463 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 18:28:19,464 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 15 treesize of output 15 [2024-11-16 18:28:19,566 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 43 treesize of output 42 [2024-11-16 18:28:19,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-16 18:28:19,843 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 18:28:19,843 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 40 treesize of output 24 [2024-11-16 18:28:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:28:19,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871129436] [2024-11-16 18:28:20,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186706140] [2024-11-16 18:28:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186706140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:20,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-16 18:28:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759736156] [2024-11-16 18:28:20,602 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 18:28:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:28:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:28:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:20,603 INFO L87 Difference]: Start difference. First operand 657 states and 902 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 18:28:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:22,377 INFO L93 Difference]: Finished difference Result 1351 states and 1853 transitions. [2024-11-16 18:28:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 112 [2024-11-16 18:28:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:22,382 INFO L225 Difference]: With dead ends: 1351 [2024-11-16 18:28:22,382 INFO L226 Difference]: Without dead ends: 750 [2024-11-16 18:28:22,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:28:22,384 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 339 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:22,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 770 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 18:28:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-16 18:28:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 657. [2024-11-16 18:28:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 599 states have (on average 1.342237061769616) internal successors, (804), 604 states have internal predecessors, (804), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 902 transitions. [2024-11-16 18:28:22,423 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 902 transitions. Word has length 112 [2024-11-16 18:28:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:22,424 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 902 transitions. [2024-11-16 18:28:22,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 18:28:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 902 transitions. [2024-11-16 18:28:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:28:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:22,426 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:22,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 18:28:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:22,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1019808712, now seen corresponding path program 1 times [2024-11-16 18:28:22,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519839401] [2024-11-16 18:28:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276562554] [2024-11-16 18:28:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:22,701 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:22,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 18:28:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:23,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 18:28:23,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:23,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:28:23,448 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-16 18:28:23,448 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 15 treesize of output 15 [2024-11-16 18:28:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-16 18:28:23,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:23,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519839401] [2024-11-16 18:28:23,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276562554] [2024-11-16 18:28:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276562554] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:23,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-16 18:28:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739576884] [2024-11-16 18:28:23,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:28:23,714 INFO L87 Difference]: Start difference. First operand 657 states and 902 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:23,856 INFO L93 Difference]: Finished difference Result 1437 states and 1966 transitions. [2024-11-16 18:28:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:23,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-16 18:28:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:23,860 INFO L225 Difference]: With dead ends: 1437 [2024-11-16 18:28:23,860 INFO L226 Difference]: Without dead ends: 836 [2024-11-16 18:28:23,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:28:23,862 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 72 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:23,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 547 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-16 18:28:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 653. [2024-11-16 18:28:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 595 states have (on average 1.33781512605042) internal successors, (796), 600 states have internal predecessors, (796), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 44 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 894 transitions. [2024-11-16 18:28:23,915 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 894 transitions. Word has length 112 [2024-11-16 18:28:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:23,916 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 894 transitions. [2024-11-16 18:28:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 894 transitions. [2024-11-16 18:28:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:28:23,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:23,918 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:23,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 18:28:24,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-16 18:28:24,122 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -784501906, now seen corresponding path program 1 times [2024-11-16 18:28:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:24,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065055552] [2024-11-16 18:28:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065055552] [2024-11-16 18:28:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065055552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:28:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298549802] [2024-11-16 18:28:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:28:24,284 INFO L87 Difference]: Start difference. First operand 653 states and 894 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:24,352 INFO L93 Difference]: Finished difference Result 1217 states and 1672 transitions. [2024-11-16 18:28:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-16 18:28:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:24,355 INFO L225 Difference]: With dead ends: 1217 [2024-11-16 18:28:24,355 INFO L226 Difference]: Without dead ends: 598 [2024-11-16 18:28:24,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:24,358 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 68 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:24,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 570 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:28:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-16 18:28:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 584. [2024-11-16 18:28:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 526 states have (on average 1.326996197718631) internal successors, (698), 532 states have internal predecessors, (698), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 43 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 796 transitions. [2024-11-16 18:28:24,391 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 796 transitions. Word has length 112 [2024-11-16 18:28:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:24,392 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 796 transitions. [2024-11-16 18:28:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 796 transitions. [2024-11-16 18:28:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:28:24,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:24,394 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:24,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 18:28:24,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:24,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1147488709, now seen corresponding path program 1 times [2024-11-16 18:28:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865614538] [2024-11-16 18:28:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:28:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:28:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:28:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:28:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:28:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:28:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:28:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:28:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:28:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:28:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:28:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865614538] [2024-11-16 18:28:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865614538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:28:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869308490] [2024-11-16 18:28:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:28:24,526 INFO L87 Difference]: Start difference. First operand 584 states and 796 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:24,646 INFO L93 Difference]: Finished difference Result 1337 states and 1821 transitions. [2024-11-16 18:28:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:24,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-16 18:28:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:24,650 INFO L225 Difference]: With dead ends: 1337 [2024-11-16 18:28:24,650 INFO L226 Difference]: Without dead ends: 798 [2024-11-16 18:28:24,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:24,652 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 95 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:24,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 707 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-16 18:28:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 627. [2024-11-16 18:28:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 569 states have (on average 1.3198594024604569) internal successors, (751), 575 states have internal predecessors, (751), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 43 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 18:28:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 849 transitions. [2024-11-16 18:28:24,687 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 849 transitions. Word has length 112 [2024-11-16 18:28:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:24,688 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 849 transitions. [2024-11-16 18:28:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 849 transitions. [2024-11-16 18:28:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 18:28:24,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:24,689 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:24,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:28:24,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 464012278, now seen corresponding path program 1 times [2024-11-16 18:28:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519181692] [2024-11-16 18:28:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458884785] [2024-11-16 18:28:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:24,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:24,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 18:28:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:25,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 18:28:25,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:25,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-16 18:28:26,107 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 8 treesize of output 1 [2024-11-16 18:28:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-16 18:28:26,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-16 18:28:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-16 18:28:26,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:26,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-16 18:28:26,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-16 18:28:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:28:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519181692] [2024-11-16 18:28:26,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 18:28:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458884785] [2024-11-16 18:28:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458884785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:26,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-16 18:28:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996789279] [2024-11-16 18:28:26,567 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 18:28:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:28:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:28:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:28:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:26,569 INFO L87 Difference]: Start difference. First operand 627 states and 849 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 18:28:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:27,290 INFO L93 Difference]: Finished difference Result 1144 states and 1535 transitions. [2024-11-16 18:28:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 18:28:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2024-11-16 18:28:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:27,293 INFO L225 Difference]: With dead ends: 1144 [2024-11-16 18:28:27,293 INFO L226 Difference]: Without dead ends: 562 [2024-11-16 18:28:27,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2024-11-16 18:28:27,296 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 292 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:27,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 788 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 410 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:28:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-16 18:28:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 469. [2024-11-16 18:28:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 423 states have (on average 1.309692671394799) internal successors, (554), 427 states have internal predecessors, (554), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:28:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 626 transitions. [2024-11-16 18:28:27,331 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 626 transitions. Word has length 113 [2024-11-16 18:28:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:27,331 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 626 transitions. [2024-11-16 18:28:27,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 18:28:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 626 transitions. [2024-11-16 18:28:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 18:28:27,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:27,333 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:27,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-16 18:28:27,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:27,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:27,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -976379306, now seen corresponding path program 1 times [2024-11-16 18:28:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:28:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086015817] [2024-11-16 18:28:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:28:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:28:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737110065] [2024-11-16 18:28:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:28:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:27,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:28:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 18:28:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:28:28,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:28:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:28:28,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:28:28,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:28:28,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:28:28,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 18:28:28,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-16 18:28:28,487 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:28,646 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:28:28,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:28:28 BoogieIcfgContainer [2024-11-16 18:28:28,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:28:28,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:28:28,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:28:28,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:28:28,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:27:56" (3/4) ... [2024-11-16 18:28:28,652 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:28:28,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:28:28,653 INFO L158 Benchmark]: Toolchain (without parser) took 33435.21ms. Allocated memory was 159.4MB in the beginning and 497.0MB in the end (delta: 337.6MB). Free memory was 94.6MB in the beginning and 440.3MB in the end (delta: -345.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:28:28,653 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:28:28,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.37ms. Allocated memory is still 159.4MB. Free memory was 94.6MB in the beginning and 125.6MB in the end (delta: -31.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-16 18:28:28,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.76ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 120.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:28:28,654 INFO L158 Benchmark]: Boogie Preprocessor took 96.12ms. Allocated memory is still 159.4MB. Free memory was 120.7MB in the beginning and 115.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:28:28,654 INFO L158 Benchmark]: IcfgBuilder took 871.42ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 73.9MB in the end (delta: 42.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-16 18:28:28,655 INFO L158 Benchmark]: TraceAbstraction took 31891.19ms. Allocated memory was 192.9MB in the beginning and 497.0MB in the end (delta: 304.1MB). Free memory was 160.3MB in the beginning and 440.3MB in the end (delta: -280.0MB). Peak memory consumption was 302.7MB. Max. memory is 16.1GB. [2024-11-16 18:28:28,655 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 497.0MB. Free memory is still 440.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:28:28,656 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.17ms. Allocated memory is still 92.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.37ms. Allocated memory is still 159.4MB. Free memory was 94.6MB in the beginning and 125.6MB in the end (delta: -31.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.76ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 120.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.12ms. Allocated memory is still 159.4MB. Free memory was 120.7MB in the beginning and 115.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 871.42ms. Allocated memory is still 159.4MB. Free memory was 115.9MB in the beginning and 73.9MB in the end (delta: 42.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31891.19ms. Allocated memory was 192.9MB in the beginning and 497.0MB in the end (delta: 304.1MB). Free memory was 160.3MB in the beginning and 440.3MB in the end (delta: -280.0MB). Peak memory consumption was 302.7MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 497.0MB. Free memory is still 440.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of bitwiseOr at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L26-L28] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L34-L36] signed char signed_char_Array_0[2] = { 5, 64 }; [L34-L36] signed char signed_char_Array_0[2] = { 5, 64 }; [L34-L36] signed char signed_char_Array_0[2] = { 5, 64 }; [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L39-L41] signed short int signed_short_int_Array_0[1] = { -128 }; [L39-L41] signed short int signed_short_int_Array_0[1] = { -128 }; [L42] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L43-L45] unsigned char unsigned_char_Array_0[1] = { 4 }; [L43-L45] unsigned char unsigned_char_Array_0[1] = { 4 }; [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L47-L49] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L47-L49] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L47-L49] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L50] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L51] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L52] unsigned short int last_1_unsigned_short_int_Array_0_1_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=0, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_short_int_Array_0[1] [L104] last_1_unsigned_short_int_Array_0_1_ = unsigned_short_int_Array_0[1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L85] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L86] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L87] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L87] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L88] double_Array_0[1] = __VERIFIER_nondet_double() [L89] EXPR double_Array_0[1] [L89] EXPR double_Array_0[1] >= -461168.6018427382800e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L89] EXPR double_Array_0[1] [L89] EXPR double_Array_0[1] >= -461168.6018427382800e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+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}, \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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L89] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L90] double_Array_0[3] = __VERIFIER_nondet_double() [L91] EXPR double_Array_0[3] [L91] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L91] EXPR double_Array_0[3] [L91] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L91] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L92] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L93] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L93] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L94] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L94] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L94] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L95] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L97] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L99] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L115] RET updateVariables() [L116] CALL step() [L56] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = 200 [L57] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L57] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) [L58] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L58] (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L59] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L59] signed long int stepLocal_0 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)); [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L60] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L63] EXPR \read(*signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L63] EXPR (((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L63] EXPR (((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, stepLocal_0=0, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L63] COND TRUE stepLocal_0 >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_)))) [L64] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L64] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L69] signed long int stepLocal_2 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)); [L70] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L70] EXPR \read(*signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L70] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, stepLocal_2=1, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L70] signed long int stepLocal_1 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)); [L71] EXPR \read(*signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L71] COND FALSE !((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= stepLocal_2) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L80] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L80] EXPR \read(*signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L80] COND FALSE !((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L107] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L107] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L107] EXPR \read(*signed_char_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L107] EXPR (((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L107] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L107] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L107] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L107] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L107] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L107] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L107] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L107] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L107] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L107-L108] return ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))))) : ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) >= (((((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) <= ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) + (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) ^ (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) < ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 200))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ; [L117] RET, EXPR property() [L117] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 3106 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3106 mSDsluCounter, 13545 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9934 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3125 IncrementalHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 3611 mSDtfsCounter, 3125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1847 GetRequests, 1655 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=13, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 1583 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 3541 NumberOfCodeBlocks, 3541 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2734 ConstructedInterpolants, 66 QuantifiedInterpolants, 19142 SizeOfPredicates, 108 NumberOfNonLiveVariables, 4152 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 4769/5500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:28:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4401c8d858d7e27d3ac20a1c2254173b907c9ae63c734789626e79fce7633b83 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:28:30,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:28:30,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:28:30,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:28:30,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:28:30,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:28:30,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:28:30,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:28:30,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:28:30,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:28:30,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:28:30,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:28:30,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:28:30,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:28:30,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:28:30,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:28:30,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:28:30,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:28:30,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:28:30,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:28:30,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:28:30,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:28:30,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:28:30,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:28:30,978 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:28:30,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:28:30,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:28:30,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:28:30,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:28:30,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:28:30,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:28:30,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:28:30,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:28:30,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:28:30,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:28:30,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:28:30,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:28:30,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:28:30,983 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:28:30,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:28:30,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:28:30,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:28:30,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:28:30,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:28:30,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4401c8d858d7e27d3ac20a1c2254173b907c9ae63c734789626e79fce7633b83 [2024-11-16 18:28:31,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:28:31,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:28:31,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:28:31,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:28:31,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:28:31,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:28:32,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:28:33,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:28:33,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:28:33,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587ed4fb4/3aa4627ab548473cb909fcc4957e72d0/FLAGc812a6389 [2024-11-16 18:28:33,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587ed4fb4/3aa4627ab548473cb909fcc4957e72d0 [2024-11-16 18:28:33,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:28:33,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:28:33,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:28:33,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:28:33,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:28:33,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406e6a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33, skipping insertion in model container [2024-11-16 18:28:33,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:28:33,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i[917,930] [2024-11-16 18:28:33,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:28:33,377 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:28:33,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-83.i[917,930] [2024-11-16 18:28:33,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:28:33,493 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:28:33,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33 WrapperNode [2024-11-16 18:28:33,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:28:33,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:28:33,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:28:33,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:28:33,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,579 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2024-11-16 18:28:33,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:28:33,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:28:33,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:28:33,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:28:33,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,656 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2024-11-16 18:28:33,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:28:33,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:28:33,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:28:33,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:28:33,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (1/1) ... [2024-11-16 18:28:33,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:28:33,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:28:33,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:28:33,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:28:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:28:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-16 18:28:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-16 18:28:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-16 18:28:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-16 18:28:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-16 18:28:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-16 18:28:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-16 18:28:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 18:28:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 18:28:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-16 18:28:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-16 18:28:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-16 18:28:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-16 18:28:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-16 18:28:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:28:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:28:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:28:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:28:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:28:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:28:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-16 18:28:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-16 18:28:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-16 18:28:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:28:33,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:28:33,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:28:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:28:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:28:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:28:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:28:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-16 18:28:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-16 18:28:34,067 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:28:34,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:28:35,084 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem77#1;havoc property_#t~ite102#1;havoc property_#t~mem91#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2024-11-16 18:28:35,135 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-16 18:28:35,136 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:28:35,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:28:35,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:28:35,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:28:35 BoogieIcfgContainer [2024-11-16 18:28:35,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:28:35,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:28:35,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:28:35,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:28:35,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:28:33" (1/3) ... [2024-11-16 18:28:35,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf0ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:28:35, skipping insertion in model container [2024-11-16 18:28:35,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:33" (2/3) ... [2024-11-16 18:28:35,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf0ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:28:35, skipping insertion in model container [2024-11-16 18:28:35,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:28:35" (3/3) ... [2024-11-16 18:28:35,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-83.i [2024-11-16 18:28:35,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:28:35,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:28:35,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:28:35,261 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;@224b3da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:28:35,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:28:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:28:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:35,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:35,280 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:35,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:35,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -11088518, now seen corresponding path program 1 times [2024-11-16 18:28:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012186572] [2024-11-16 18:28:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:35,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:35,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:28:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:35,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:28:35,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-16 18:28:35,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:35,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012186572] [2024-11-16 18:28:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012186572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:28:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630997327] [2024-11-16 18:28:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:35,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:28:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:35,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:28:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:28:35,818 INFO L87 Difference]: Start difference. First operand has 106 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:28:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:35,847 INFO L93 Difference]: Finished difference Result 204 states and 312 transitions. [2024-11-16 18:28:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:28:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-16 18:28:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:35,858 INFO L225 Difference]: With dead ends: 204 [2024-11-16 18:28:35,858 INFO L226 Difference]: Without dead ends: 101 [2024-11-16 18:28:35,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:28:35,866 INFO L432 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:35,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:28:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-16 18:28:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-16 18:28:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:28:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-11-16 18:28:35,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 106 [2024-11-16 18:28:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:35,916 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-11-16 18:28:35,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:28:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-11-16 18:28:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:35,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:35,920 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:35,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:36,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:36,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1469392561, now seen corresponding path program 1 times [2024-11-16 18:28:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60210520] [2024-11-16 18:28:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:36,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:36,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:28:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:36,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:28:36,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:36,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-16 18:28:36,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-16 18:28:36,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:36,935 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 17 treesize of output 22 [2024-11-16 18:28:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:37,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:37,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60210520] [2024-11-16 18:28:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60210520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:37,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:37,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760340592] [2024-11-16 18:28:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:37,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:37,014 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:37,855 INFO L93 Difference]: Finished difference Result 373 states and 519 transitions. [2024-11-16 18:28:37,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:28:37,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:37,861 INFO L225 Difference]: With dead ends: 373 [2024-11-16 18:28:37,863 INFO L226 Difference]: Without dead ends: 275 [2024-11-16 18:28:37,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:28:37,865 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 246 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:37,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1005 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:28:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-16 18:28:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2024-11-16 18:28:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 183 states have (on average 1.349726775956284) internal successors, (247), 184 states have internal predecessors, (247), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2024-11-16 18:28:37,904 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 106 [2024-11-16 18:28:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:37,908 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2024-11-16 18:28:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2024-11-16 18:28:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:37,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:37,910 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:37,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:38,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:38,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:38,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1500412368, now seen corresponding path program 1 times [2024-11-16 18:28:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312845602] [2024-11-16 18:28:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:38,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:38,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:38,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:28:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:38,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:28:38,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:38,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-16 18:28:38,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:38,638 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 17 treesize of output 22 [2024-11-16 18:28:38,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-16 18:28:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:38,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:38,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:38,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312845602] [2024-11-16 18:28:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312845602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:38,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720408464] [2024-11-16 18:28:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:38,853 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:40,391 INFO L93 Difference]: Finished difference Result 418 states and 579 transitions. [2024-11-16 18:28:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:40,397 INFO L225 Difference]: With dead ends: 418 [2024-11-16 18:28:40,397 INFO L226 Difference]: Without dead ends: 320 [2024-11-16 18:28:40,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:28:40,399 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 273 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:40,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 592 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 18:28:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-16 18:28:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 234. [2024-11-16 18:28:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 203 states have (on average 1.3448275862068966) internal successors, (273), 204 states have internal predecessors, (273), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 325 transitions. [2024-11-16 18:28:40,427 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 325 transitions. Word has length 106 [2024-11-16 18:28:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:40,428 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 325 transitions. [2024-11-16 18:28:40,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 325 transitions. [2024-11-16 18:28:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:40,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:40,429 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:40,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 18:28:40,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:40,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:40,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash 503340015, now seen corresponding path program 1 times [2024-11-16 18:28:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618115120] [2024-11-16 18:28:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:40,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:40,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:40,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:40,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:28:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:40,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:28:40,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:41,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:41,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618115120] [2024-11-16 18:28:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618115120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:28:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696628745] [2024-11-16 18:28:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:28:41,039 INFO L87 Difference]: Start difference. First operand 234 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:41,094 INFO L93 Difference]: Finished difference Result 380 states and 529 transitions. [2024-11-16 18:28:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:41,099 INFO L225 Difference]: With dead ends: 380 [2024-11-16 18:28:41,099 INFO L226 Difference]: Without dead ends: 244 [2024-11-16 18:28:41,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:28:41,104 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:41,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 524 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:28:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-16 18:28:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-11-16 18:28:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.3317535545023698) internal successors, (281), 212 states have internal predecessors, (281), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2024-11-16 18:28:41,136 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 106 [2024-11-16 18:28:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:41,140 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2024-11-16 18:28:41,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2024-11-16 18:28:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:41,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:41,142 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:41,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:41,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 306826510, now seen corresponding path program 1 times [2024-11-16 18:28:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534138785] [2024-11-16 18:28:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:41,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:41,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:41,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 18:28:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:41,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:28:41,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:41,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:41,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534138785] [2024-11-16 18:28:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534138785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:41,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357616323] [2024-11-16 18:28:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:28:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:28:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:41,779 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:41,846 INFO L93 Difference]: Finished difference Result 380 states and 523 transitions. [2024-11-16 18:28:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:28:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:41,849 INFO L225 Difference]: With dead ends: 380 [2024-11-16 18:28:41,849 INFO L226 Difference]: Without dead ends: 248 [2024-11-16 18:28:41,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:28:41,851 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:41,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 645 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-16 18:28:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2024-11-16 18:28:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 216 states have internal predecessors, (285), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 337 transitions. [2024-11-16 18:28:41,871 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 337 transitions. Word has length 106 [2024-11-16 18:28:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:41,873 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 337 transitions. [2024-11-16 18:28:41,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2024-11-16 18:28:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:41,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:41,878 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 18:28:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:42,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2049636845, now seen corresponding path program 1 times [2024-11-16 18:28:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176272387] [2024-11-16 18:28:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:42,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:42,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 18:28:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:42,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:28:42,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:42,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:42,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176272387] [2024-11-16 18:28:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176272387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:28:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819002149] [2024-11-16 18:28:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:42,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:42,446 INFO L87 Difference]: Start difference. First operand 246 states and 337 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:42,517 INFO L93 Difference]: Finished difference Result 384 states and 526 transitions. [2024-11-16 18:28:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:28:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:42,520 INFO L225 Difference]: With dead ends: 384 [2024-11-16 18:28:42,520 INFO L226 Difference]: Without dead ends: 252 [2024-11-16 18:28:42,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:42,522 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:42,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 767 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-16 18:28:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2024-11-16 18:28:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 220 states have internal predecessors, (289), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:28:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2024-11-16 18:28:42,541 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 106 [2024-11-16 18:28:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:42,541 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2024-11-16 18:28:42,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2024-11-16 18:28:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:42,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:42,547 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:42,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-16 18:28:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:42,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2078265996, now seen corresponding path program 1 times [2024-11-16 18:28:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:42,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450014026] [2024-11-16 18:28:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:42,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:42,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:42,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:42,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 18:28:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:43,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:28:43,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:43,292 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 18 treesize of output 14 [2024-11-16 18:28:43,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:28:43,531 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 76 treesize of output 68 [2024-11-16 18:28:43,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2024-11-16 18:28:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-16 18:28:43,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:43,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450014026] [2024-11-16 18:28:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450014026] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:43,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2024-11-16 18:28:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573361846] [2024-11-16 18:28:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:28:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:28:43,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:28:43,847 INFO L87 Difference]: Start difference. First operand 250 states and 341 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:44,363 INFO L93 Difference]: Finished difference Result 573 states and 776 transitions. [2024-11-16 18:28:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:28:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:44,366 INFO L225 Difference]: With dead ends: 573 [2024-11-16 18:28:44,366 INFO L226 Difference]: Without dead ends: 431 [2024-11-16 18:28:44,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:44,367 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 234 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:44,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 835 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:28:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-16 18:28:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2024-11-16 18:28:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 383 states have (on average 1.3263707571801566) internal successors, (508), 386 states have internal predecessors, (508), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:28:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 580 transitions. [2024-11-16 18:28:44,395 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 580 transitions. Word has length 106 [2024-11-16 18:28:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:44,395 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 580 transitions. [2024-11-16 18:28:44,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 580 transitions. [2024-11-16 18:28:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:44,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:44,398 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:44,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:44,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:44,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -863391603, now seen corresponding path program 1 times [2024-11-16 18:28:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491757653] [2024-11-16 18:28:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:44,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:44,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-16 18:28:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:44,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:28:44,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:45,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 18:28:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:28:45,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:45,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491757653] [2024-11-16 18:28:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491757653] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:45,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:45,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-16 18:28:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849410377] [2024-11-16 18:28:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:28:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:28:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:28:45,564 INFO L87 Difference]: Start difference. First operand 427 states and 580 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:45,663 INFO L93 Difference]: Finished difference Result 735 states and 1002 transitions. [2024-11-16 18:28:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:28:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:45,670 INFO L225 Difference]: With dead ends: 735 [2024-11-16 18:28:45,671 INFO L226 Difference]: Without dead ends: 431 [2024-11-16 18:28:45,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:28:45,672 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:45,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-16 18:28:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2024-11-16 18:28:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 387 states have (on average 1.322997416020672) internal successors, (512), 390 states have internal predecessors, (512), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:28:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 584 transitions. [2024-11-16 18:28:45,694 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 584 transitions. Word has length 106 [2024-11-16 18:28:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 584 transitions. [2024-11-16 18:28:45,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 584 transitions. [2024-11-16 18:28:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:28:45,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:45,697 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:45,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 18:28:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:45,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1056653, now seen corresponding path program 1 times [2024-11-16 18:28:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977450775] [2024-11-16 18:28:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:45,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:45,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 18:28:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:46,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 18:28:46,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:46,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-16 18:28:46,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-16 18:28:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:28:46,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:46,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-16 18:28:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:47,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977450775] [2024-11-16 18:28:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977450775] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:47,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-16 18:28:47,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533204536] [2024-11-16 18:28:47,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:28:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:47,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:28:47,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:28:47,035 INFO L87 Difference]: Start difference. First operand 431 states and 584 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:47,175 INFO L93 Difference]: Finished difference Result 643 states and 876 transitions. [2024-11-16 18:28:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:28:47,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-16 18:28:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:47,178 INFO L225 Difference]: With dead ends: 643 [2024-11-16 18:28:47,178 INFO L226 Difference]: Without dead ends: 442 [2024-11-16 18:28:47,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:28:47,181 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 25 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 425 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:47,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 425 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:28:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-16 18:28:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2024-11-16 18:28:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 388 states have (on average 1.3195876288659794) internal successors, (512), 391 states have internal predecessors, (512), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:28:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 584 transitions. [2024-11-16 18:28:47,203 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 584 transitions. Word has length 106 [2024-11-16 18:28:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:47,204 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 584 transitions. [2024-11-16 18:28:47,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 584 transitions. [2024-11-16 18:28:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:28:47,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:47,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:47,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 18:28:47,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:47,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1411701912, now seen corresponding path program 1 times [2024-11-16 18:28:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99352914] [2024-11-16 18:28:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:47,410 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:47,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-16 18:28:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:47,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:28:47,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-16 18:28:48,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 18:28:48,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-16 18:28:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:28:48,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:50,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-16 18:28:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:50,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:50,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99352914] [2024-11-16 18:28:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99352914] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:50,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:50,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-11-16 18:28:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218997410] [2024-11-16 18:28:50,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:28:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:28:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:50,164 INFO L87 Difference]: Start difference. First operand 432 states and 584 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:54,010 INFO L93 Difference]: Finished difference Result 855 states and 1156 transitions. [2024-11-16 18:28:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:28:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-16 18:28:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:54,020 INFO L225 Difference]: With dead ends: 855 [2024-11-16 18:28:54,020 INFO L226 Difference]: Without dead ends: 548 [2024-11-16 18:28:54,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:28:54,022 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 64 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:54,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 717 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 18:28:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-16 18:28:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 453. [2024-11-16 18:28:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 409 states have (on average 1.332518337408313) internal successors, (545), 412 states have internal predecessors, (545), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:28:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 617 transitions. [2024-11-16 18:28:54,045 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 617 transitions. Word has length 107 [2024-11-16 18:28:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:54,046 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 617 transitions. [2024-11-16 18:28:54,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 617 transitions. [2024-11-16 18:28:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:28:54,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:54,047 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:54,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-16 18:28:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:54,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1560975494, now seen corresponding path program 1 times [2024-11-16 18:28:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346804406] [2024-11-16 18:28:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:54,250 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 18:28:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:54,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:28:54,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:54,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-16 18:28:55,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-16 18:28:55,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-16 18:28:55,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-16 18:28:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:28:55,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:28:55,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-16 18:28:56,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-16 18:28:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:56,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346804406] [2024-11-16 18:28:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346804406] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:28:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:28:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-16 18:28:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444380846] [2024-11-16 18:28:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:28:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:28:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:28:56,105 INFO L87 Difference]: Start difference. First operand 453 states and 617 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:56,952 INFO L93 Difference]: Finished difference Result 658 states and 899 transitions. [2024-11-16 18:28:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:28:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-16 18:28:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:56,956 INFO L225 Difference]: With dead ends: 658 [2024-11-16 18:28:56,956 INFO L226 Difference]: Without dead ends: 364 [2024-11-16 18:28:56,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:28:56,958 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:56,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 551 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:28:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-16 18:28:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-16 18:28:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 325 states have (on average 1.3169230769230769) internal successors, (428), 327 states have internal predecessors, (428), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:28:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2024-11-16 18:28:56,979 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 107 [2024-11-16 18:28:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:56,979 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2024-11-16 18:28:56,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2024-11-16 18:28:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:28:56,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:56,981 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:56,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:57,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -450087895, now seen corresponding path program 1 times [2024-11-16 18:28:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884358942] [2024-11-16 18:28:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:57,184 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:57,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 18:28:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:28:57,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:28:57,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:28:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-16 18:28:57,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-16 18:28:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:28:57,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:28:57,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:28:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884358942] [2024-11-16 18:28:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884358942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:28:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:28:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:28:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528449983] [2024-11-16 18:28:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:28:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:28:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:28:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:28:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:28:57,788 INFO L87 Difference]: Start difference. First operand 364 states and 492 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:28:59,309 INFO L93 Difference]: Finished difference Result 684 states and 923 transitions. [2024-11-16 18:28:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:28:59,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-16 18:28:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:28:59,314 INFO L225 Difference]: With dead ends: 684 [2024-11-16 18:28:59,314 INFO L226 Difference]: Without dead ends: 479 [2024-11-16 18:28:59,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:28:59,315 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 279 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:28:59,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 623 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 18:28:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-16 18:28:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 367. [2024-11-16 18:28:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 328 states have (on average 1.3201219512195121) internal successors, (433), 330 states have internal predecessors, (433), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:28:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 497 transitions. [2024-11-16 18:28:59,333 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 497 transitions. Word has length 107 [2024-11-16 18:28:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:28:59,333 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 497 transitions. [2024-11-16 18:28:59,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:28:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 497 transitions. [2024-11-16 18:28:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:28:59,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:28:59,334 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:28:59,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-16 18:28:59,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:59,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:28:59,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:28:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash -311565355, now seen corresponding path program 1 times [2024-11-16 18:28:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:28:59,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107999495] [2024-11-16 18:28:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:28:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:28:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:28:59,539 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:28:59,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 18:29:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:29:00,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 18:29:00,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:29:00,547 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 8 treesize of output 1 [2024-11-16 18:29:01,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 55 [2024-11-16 18:29:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 55 [2024-11-16 18:29:02,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 92 [2024-11-16 18:29:03,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:29:03,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 310 treesize of output 134 [2024-11-16 18:29:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:29:03,521 INFO L311 TraceCheckSpWp]: Computing backward predicates...