./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-9.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 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:31:28,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:31:29,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:31:29,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:31:29,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:31:29,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:31:29,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:31:29,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:31:29,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:31:29,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:31:29,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:31:29,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:31:29,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:31:29,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:31:29,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:31:29,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:31:29,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:31:29,063 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:31:29,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:31:29,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:31:29,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:31:29,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:31:29,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:31:29,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:31:29,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:31:29,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:31:29,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:31:29,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:31:29,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:31:29,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:31:29,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:31:29,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:31:29,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:31:29,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:31:29,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:31:29,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:31:29,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:31:29,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:31:29,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:31:29,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:31:29,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:31:29,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:31:29,072 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 -> 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb [2024-11-10 09:31:29,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:31:29,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:31:29,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:31:29,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:31:29,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:31:29,345 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-9.i [2024-11-10 09:31:30,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:31:31,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:31:31,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i [2024-11-10 09:31:31,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff79fe453/b7d3ed711bc045b4ab5eaa411679add6/FLAG5c551268e [2024-11-10 09:31:31,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff79fe453/b7d3ed711bc045b4ab5eaa411679add6 [2024-11-10 09:31:31,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:31:31,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:31:31,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:31:31,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:31:31,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:31:31,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:31" (1/1) ... [2024-11-10 09:31:31,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e81523f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:31, skipping insertion in model container [2024-11-10 09:31:31,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:31" (1/1) ... [2024-11-10 09:31:31,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:31:31,804 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-9.i[916,929] [2024-11-10 09:31:31,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:31:31,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:31:31,929 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-9.i[916,929] [2024-11-10 09:31:31,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:31:32,005 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:31:32,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32 WrapperNode [2024-11-10 09:31:32,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:31:32,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:31:32,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:31:32,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:31:32,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,077 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 358 [2024-11-10 09:31:32,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:31:32,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:31:32,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:31:32,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:31:32,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,134 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2024-11-10 09:31:32,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:31:32,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:31:32,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:31:32,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:31:32,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (1/1) ... [2024-11-10 09:31:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:31:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:31:32,293 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-10 09:31:32,306 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-10 09:31:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:31:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:31:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:31:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:31:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:31:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:31:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:31:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:31:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:31:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:31:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:31:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:31:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:31:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:31:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:31:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:31:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:31:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:31:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:31:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:31:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:31:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:31:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:31:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:31:32,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:31:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:31:32,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:31:32,480 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:31:32,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:31:32,767 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem45#1;havoc property_#t~ite63#1;havoc property_#t~mem47#1;havoc property_#t~mem46#1;havoc property_#t~mem48#1;havoc property_#t~mem49#1;havoc property_#t~ite52#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~mem53#1;havoc property_#t~ite62#1;havoc property_#t~mem54#1;havoc property_#t~ite59#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~mem58#1;havoc property_#t~mem57#1;havoc property_#t~mem61#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~short77#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1; [2024-11-10 09:31:32,800 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-10 09:31:32,801 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:31:32,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:31:32,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:31:32,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:31:32 BoogieIcfgContainer [2024-11-10 09:31:32,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:31:32,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:31:32,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:31:32,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:31:32,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:31:31" (1/3) ... [2024-11-10 09:31:32,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21734953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:32, skipping insertion in model container [2024-11-10 09:31:32,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:32" (2/3) ... [2024-11-10 09:31:32,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21734953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:32, skipping insertion in model container [2024-11-10 09:31:32,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:31:32" (3/3) ... [2024-11-10 09:31:32,839 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-9.i [2024-11-10 09:31:32,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:31:32,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:31:32,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:31:32,928 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;@4192538b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:31:32,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:31:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:32,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:32,942 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:32,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:32,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1035748990, now seen corresponding path program 1 times [2024-11-10 09:31:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:32,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741559596] [2024-11-10 09:31:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741559596] [2024-11-10 09:31:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741559596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:31:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42083773] [2024-11-10 09:31:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:33,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:31:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:31:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:31:33,339 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:33,374 INFO L93 Difference]: Finished difference Result 150 states and 218 transitions. [2024-11-10 09:31:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:31:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-10 09:31:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:33,384 INFO L225 Difference]: With dead ends: 150 [2024-11-10 09:31:33,384 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 09:31:33,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-10 09:31:33,390 INFO L432 NwaCegarLoop]: 100 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, 100 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-10 09:31:33,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:31:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 09:31:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 09:31:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-10 09:31:33,431 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 64 [2024-11-10 09:31:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-10 09:31:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-10 09:31:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:33,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:33,436 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:33,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:31:33,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1298468543, now seen corresponding path program 1 times [2024-11-10 09:31:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616181565] [2024-11-10 09:31:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616181565] [2024-11-10 09:31:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616181565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:33,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:31:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423770151] [2024-11-10 09:31:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:31:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:33,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:31:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:31:33,780 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:33,835 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2024-11-10 09:31:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:31:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-10 09:31:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:33,838 INFO L225 Difference]: With dead ends: 148 [2024-11-10 09:31:33,840 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 09:31:33,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-10 09:31:33,842 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 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-10 09:31:33,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:31:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 09:31:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-10 09:31:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-10 09:31:33,862 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 64 [2024-11-10 09:31:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:33,864 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-10 09:31:33,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-10 09:31:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:33,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:33,866 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:33,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:31:33,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:33,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1427551262, now seen corresponding path program 1 times [2024-11-10 09:31:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430697448] [2024-11-10 09:31:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430697448] [2024-11-10 09:31:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430697448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:34,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:31:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397893581] [2024-11-10 09:31:34,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:34,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:31:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:31:34,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:31:34,216 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:34,382 INFO L93 Difference]: Finished difference Result 271 states and 374 transitions. [2024-11-10 09:31:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:31:34,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-10 09:31:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:34,384 INFO L225 Difference]: With dead ends: 271 [2024-11-10 09:31:34,386 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 09:31:34,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:31:34,388 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 354 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:34,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 518 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 09:31:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 144. [2024-11-10 09:31:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 131 states have (on average 1.366412213740458) internal successors, (179), 131 states have internal predecessors, (179), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 09:31:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 199 transitions. [2024-11-10 09:31:34,413 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 199 transitions. Word has length 64 [2024-11-10 09:31:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:34,413 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 199 transitions. [2024-11-10 09:31:34,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 199 transitions. [2024-11-10 09:31:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 09:31:34,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:34,418 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:34,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:31:34,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash 957861184, now seen corresponding path program 1 times [2024-11-10 09:31:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779689963] [2024-11-10 09:31:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:34,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779689963] [2024-11-10 09:31:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779689963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:31:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015850282] [2024-11-10 09:31:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:31:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:31:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:31:34,539 INFO L87 Difference]: Start difference. First operand 144 states and 199 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:34,601 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2024-11-10 09:31:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:31:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 65 [2024-11-10 09:31:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:34,604 INFO L225 Difference]: With dead ends: 291 [2024-11-10 09:31:34,604 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 09:31:34,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-10 09:31:34,606 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:34,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:31:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 09:31:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2024-11-10 09:31:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 09:31:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-10 09:31:34,623 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 65 [2024-11-10 09:31:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:34,623 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-10 09:31:34,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-10 09:31:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 09:31:34,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:34,625 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:34,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:31:34,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 986490335, now seen corresponding path program 1 times [2024-11-10 09:31:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:34,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38187544] [2024-11-10 09:31:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38187544] [2024-11-10 09:31:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38187544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:31:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620029478] [2024-11-10 09:31:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:35,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:31:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:31:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:31:35,053 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:35,384 INFO L93 Difference]: Finished difference Result 319 states and 435 transitions. [2024-11-10 09:31:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:31:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 65 [2024-11-10 09:31:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:35,389 INFO L225 Difference]: With dead ends: 319 [2024-11-10 09:31:35,390 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 09:31:35,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:31:35,397 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 141 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:35,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 334 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:31:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 09:31:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2024-11-10 09:31:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 156 states have internal predecessors, (206), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:31:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2024-11-10 09:31:35,436 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 65 [2024-11-10 09:31:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:35,441 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2024-11-10 09:31:35,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2024-11-10 09:31:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 09:31:35,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:35,446 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:35,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:31:35,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:35,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash -102012157, now seen corresponding path program 1 times [2024-11-10 09:31:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588214876] [2024-11-10 09:31:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588214876] [2024-11-10 09:31:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588214876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:35,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:31:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824767841] [2024-11-10 09:31:35,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:35,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:31:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:31:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:31:35,764 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:35,999 INFO L93 Difference]: Finished difference Result 464 states and 620 transitions. [2024-11-10 09:31:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:31:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-10 09:31:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:36,002 INFO L225 Difference]: With dead ends: 464 [2024-11-10 09:31:36,002 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 09:31:36,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:31:36,003 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 346 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:36,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 628 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:31:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 09:31:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 192. [2024-11-10 09:31:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 174 states have (on average 1.339080459770115) internal successors, (233), 175 states have internal predecessors, (233), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 09:31:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2024-11-10 09:31:36,015 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 69 [2024-11-10 09:31:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2024-11-10 09:31:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2024-11-10 09:31:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 09:31:36,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:36,016 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:36,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:31:36,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:36,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash 384015067, now seen corresponding path program 1 times [2024-11-10 09:31:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040005670] [2024-11-10 09:31:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040005670] [2024-11-10 09:31:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040005670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:31:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319260482] [2024-11-10 09:31:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:36,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:31:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:31:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:31:36,116 INFO L87 Difference]: Start difference. First operand 192 states and 259 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:36,200 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2024-11-10 09:31:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:31:36,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-11-10 09:31:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:36,202 INFO L225 Difference]: With dead ends: 488 [2024-11-10 09:31:36,202 INFO L226 Difference]: Without dead ends: 312 [2024-11-10 09:31:36,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-10 09:31:36,203 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:36,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 329 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-10 09:31:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 248. [2024-11-10 09:31:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 225 states have internal predecessors, (293), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:31:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2024-11-10 09:31:36,221 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 69 [2024-11-10 09:31:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:36,221 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2024-11-10 09:31:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2024-11-10 09:31:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 09:31:36,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:36,222 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:36,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:31:36,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:36,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1504007876, now seen corresponding path program 1 times [2024-11-10 09:31:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:36,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628643195] [2024-11-10 09:31:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:36,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628643195] [2024-11-10 09:31:36,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628643195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:36,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:36,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:31:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259441340] [2024-11-10 09:31:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:36,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:31:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:31:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:31:36,428 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:36,646 INFO L93 Difference]: Finished difference Result 583 states and 775 transitions. [2024-11-10 09:31:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:31:36,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 70 [2024-11-10 09:31:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:36,648 INFO L225 Difference]: With dead ends: 583 [2024-11-10 09:31:36,648 INFO L226 Difference]: Without dead ends: 500 [2024-11-10 09:31:36,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:31:36,649 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 232 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:36,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 731 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:31:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-10 09:31:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 213. [2024-11-10 09:31:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 192 states have (on average 1.3177083333333333) internal successors, (253), 192 states have internal predecessors, (253), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:31:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2024-11-10 09:31:36,663 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 70 [2024-11-10 09:31:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:36,664 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2024-11-10 09:31:36,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2024-11-10 09:31:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 09:31:36,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:36,665 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:36,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:31:36,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:36,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash 810906179, now seen corresponding path program 1 times [2024-11-10 09:31:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778491333] [2024-11-10 09:31:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778491333] [2024-11-10 09:31:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778491333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:37,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:31:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115395807] [2024-11-10 09:31:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:37,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:31:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:31:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:31:37,024 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:37,347 INFO L93 Difference]: Finished difference Result 529 states and 704 transitions. [2024-11-10 09:31:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:31:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 70 [2024-11-10 09:31:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:37,350 INFO L225 Difference]: With dead ends: 529 [2024-11-10 09:31:37,350 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 09:31:37,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:31:37,351 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 222 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:37,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 808 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:31:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 09:31:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 213. [2024-11-10 09:31:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 192 states have (on average 1.3177083333333333) internal successors, (253), 192 states have internal predecessors, (253), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:31:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2024-11-10 09:31:37,374 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 70 [2024-11-10 09:31:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:37,374 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2024-11-10 09:31:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2024-11-10 09:31:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 09:31:37,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:37,376 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:31:37,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1976148144, now seen corresponding path program 1 times [2024-11-10 09:31:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563050983] [2024-11-10 09:31:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:31:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:31:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:31:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:31:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:31:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:31:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563050983] [2024-11-10 09:31:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563050983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:31:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139987155] [2024-11-10 09:31:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:37,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:31:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:31:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:31:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:31:37,685 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:37,812 INFO L93 Difference]: Finished difference Result 399 states and 532 transitions. [2024-11-10 09:31:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:31:37,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 70 [2024-11-10 09:31:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:37,814 INFO L225 Difference]: With dead ends: 399 [2024-11-10 09:31:37,814 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 09:31:37,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:31:37,815 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 213 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:37,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 335 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 09:31:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-10 09:31:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.3112244897959184) internal successors, (257), 196 states have internal predecessors, (257), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:31:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 287 transitions. [2024-11-10 09:31:37,832 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 287 transitions. Word has length 70 [2024-11-10 09:31:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:37,832 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 287 transitions. [2024-11-10 09:31:37,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 287 transitions. [2024-11-10 09:31:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 09:31:37,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:37,833 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:37,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:31:37,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2122305647, now seen corresponding path program 1 times [2024-11-10 09:31:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:31:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248716390] [2024-11-10 09:31:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:31:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:31:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524379535] [2024-11-10 09:31:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:31:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:31:37,894 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-10 09:31:37,894 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-10 09:31:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:31:38,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:31:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:31:38,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:31:38,325 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:31:38,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:31:38,349 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-10 09:31:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 09:31:38,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:31:38,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:31:38,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:31:38 BoogieIcfgContainer [2024-11-10 09:31:38,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:31:38,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:31:38,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:31:38,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:31:38,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:31:32" (3/4) ... [2024-11-10 09:31:38,653 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:31:38,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:31:38,655 INFO L158 Benchmark]: Toolchain (without parser) took 7232.94ms. Allocated memory was 192.9MB in the beginning and 362.8MB in the end (delta: 169.9MB). Free memory was 120.9MB in the beginning and 244.8MB in the end (delta: -123.8MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,655 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:31:38,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 192.9MB. Free memory was 120.7MB in the beginning and 105.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.94ms. Allocated memory is still 192.9MB. Free memory was 105.1MB in the beginning and 101.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,655 INFO L158 Benchmark]: Boogie Preprocessor took 129.62ms. Allocated memory is still 192.9MB. Free memory was 101.9MB in the beginning and 161.0MB in the end (delta: -59.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,656 INFO L158 Benchmark]: IcfgBuilder took 615.78ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 130.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,656 INFO L158 Benchmark]: TraceAbstraction took 5818.09ms. Allocated memory was 192.9MB in the beginning and 362.8MB in the end (delta: 169.9MB). Free memory was 128.9MB in the beginning and 245.8MB in the end (delta: -116.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,656 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 362.8MB. Free memory was 245.8MB in the beginning and 244.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:31:38,657 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.20ms. Allocated memory is still 192.9MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 192.9MB. Free memory was 120.7MB in the beginning and 105.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.94ms. Allocated memory is still 192.9MB. Free memory was 105.1MB in the beginning and 101.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.62ms. Allocated memory is still 192.9MB. Free memory was 101.9MB in the beginning and 161.0MB in the end (delta: -59.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * IcfgBuilder took 615.78ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 130.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5818.09ms. Allocated memory was 192.9MB in the beginning and 362.8MB in the end (delta: 169.9MB). Free memory was 128.9MB in the beginning and 245.8MB in the end (delta: -116.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 362.8MB. Free memory was 245.8MB in the beginning and 244.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 96, overapproximation of shiftLeft at line 96. 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[2] = { 9.2, 0.975 }; [L26-L28] double double_Array_0[2] = { 9.2, 0.975 }; [L26-L28] double double_Array_0[2] = { 9.2, 0.975 }; [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-L33] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -16 }; [L34] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L39] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L46] double last_1_double_Array_0_0_ = 9.2; [L47] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L48] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L49] unsigned char last_1_unsigned_char_Array_0_2_ = 10; 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}, isInitial=0, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L90] EXPR double_Array_0[0] [L90] last_1_double_Array_0_0_ = double_Array_0[0] [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L92] EXPR signed_short_int_Array_0[0] [L92] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L93] EXPR unsigned_char_Array_0[2] [L93] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L80] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L81] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L81] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L82] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L82] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L82] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L104] RET updateVariables() [L105] CALL step() [L53] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_0=0, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L54] COND FALSE !(((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0) [L57] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L59] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L60] EXPR 10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L60] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L60] EXPR \read(*signed_long_int_Array_0_arraysigned_long_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L60] COND TRUE (10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L61] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L63] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = 64 [L64] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L64] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L65] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L65] COND TRUE (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16 [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L66] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L96] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1) [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR 10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L96] EXPR \read(*signed_long_int_Array_0_arraysigned_long_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1 [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L96] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L96] EXPR ((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L96] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L96] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96] EXPR (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] [L96-L97] return (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ; [L106] RET, EXPR property() [L106] 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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8: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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1581 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1581 mSDsluCounter, 4345 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3222 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1036 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 1123 mSDtfsCounter, 1036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 757 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 2031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 400/400 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-10 09:31:38,691 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-9.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 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:31:40,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:31:40,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:31:40,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:31:40,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:31:40,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:31:40,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:31:40,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:31:40,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:31:40,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:31:40,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:31:40,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:31:40,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:31:40,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:31:40,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:31:40,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:31:40,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:31:40,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:31:40,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:31:40,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:31:40,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:31:40,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:31:40,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:31:40,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:31:40,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:31:40,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:31:40,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:31:40,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:31:40,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:31:40,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:31:40,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:31:40,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:31:40,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:31:40,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:31:40,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:31:40,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:31:40,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:31:40,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:31:40,998 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:31:40,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:31:40,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:31:40,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:31:40,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:31:40,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:31:40,999 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 -> 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb [2024-11-10 09:31:41,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:31:41,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:31:41,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:31:41,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:31:41,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:31:41,388 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-9.i [2024-11-10 09:31:42,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:31:43,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:31:43,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i [2024-11-10 09:31:43,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816bb6166/00237fa31c864a0ca24129dff0877715/FLAG94b4061cd [2024-11-10 09:31:43,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816bb6166/00237fa31c864a0ca24129dff0877715 [2024-11-10 09:31:43,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:31:43,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:31:43,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:31:43,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:31:43,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:31:43,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a4a93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43, skipping insertion in model container [2024-11-10 09:31:43,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:31:43,493 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-9.i[916,929] [2024-11-10 09:31:43,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:31:43,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:31:43,572 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-9.i[916,929] [2024-11-10 09:31:43,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:31:43,609 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:31:43,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43 WrapperNode [2024-11-10 09:31:43,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:31:43,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:31:43,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:31:43,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:31:43,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,688 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 344 [2024-11-10 09:31:43,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:31:43,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:31:43,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:31:43,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:31:43,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,733 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2024-11-10 09:31:43,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:31:43,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:31:43,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:31:43,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:31:43,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (1/1) ... [2024-11-10 09:31:43,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:31:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:31:43,817 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-10 09:31:43,819 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-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:31:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:31:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:31:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-10 09:31:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:31:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:31:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:31:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:31:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:31:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:31:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:31:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:31:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:31:43,987 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:31:43,989 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:31:44,383 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem44#1;havoc property_#t~ite62#1;havoc property_#t~mem46#1;havoc property_#t~mem45#1;havoc property_#t~mem47#1;havoc property_#t~mem48#1;havoc property_#t~ite51#1;havoc property_#t~mem49#1;havoc property_#t~mem50#1;havoc property_#t~mem52#1;havoc property_#t~ite61#1;havoc property_#t~mem53#1;havoc property_#t~ite58#1;havoc property_#t~mem55#1;havoc property_#t~mem54#1;havoc property_#t~mem57#1;havoc property_#t~mem56#1;havoc property_#t~mem60#1;havoc property_#t~mem59#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~short70#1;havoc property_#t~mem71#1;havoc property_#t~short72#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~short75#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~short82#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short85#1; [2024-11-10 09:31:44,404 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-10 09:31:44,404 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:31:44,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:31:44,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:31:44,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:31:44 BoogieIcfgContainer [2024-11-10 09:31:44,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:31:44,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:31:44,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:31:44,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:31:44,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:31:43" (1/3) ... [2024-11-10 09:31:44,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f65a5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:44, skipping insertion in model container [2024-11-10 09:31:44,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:43" (2/3) ... [2024-11-10 09:31:44,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f65a5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:44, skipping insertion in model container [2024-11-10 09:31:44,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:31:44" (3/3) ... [2024-11-10 09:31:44,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-9.i [2024-11-10 09:31:44,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:31:44,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:31:44,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:31:44,478 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;@3f22ef2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:31:44,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:31:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 66 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 09:31:44,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:44,488 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:44,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1273844646, now seen corresponding path program 1 times [2024-11-10 09:31:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436267519] [2024-11-10 09:31:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:31:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:44,503 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-10 09:31:44,504 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-10 09:31:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:44,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:31:44,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 09:31:44,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:31:44,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436267519] [2024-11-10 09:31:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436267519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:31:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930095002] [2024-11-10 09:31:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:31:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:31:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:31:44,735 INFO L87 Difference]: Start difference. First operand has 73 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 66 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:44,750 INFO L93 Difference]: Finished difference Result 138 states and 202 transitions. [2024-11-10 09:31:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:31:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-10 09:31:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:44,766 INFO L225 Difference]: With dead ends: 138 [2024-11-10 09:31:44,767 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 09:31:44,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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-10 09:31:44,780 INFO L432 NwaCegarLoop]: 94 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, 94 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-10 09:31:44,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:31:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 09:31:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-10 09:31:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-10 09:31:44,814 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 62 [2024-11-10 09:31:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:44,815 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-10 09:31:44,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:31:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-10 09:31:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 09:31:44,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:44,818 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:44,825 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-10 09:31:45,020 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-10 09:31:45,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2011000613, now seen corresponding path program 1 times [2024-11-10 09:31:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451378328] [2024-11-10 09:31:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:45,023 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-10 09:31:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:45,025 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-10 09:31:45,070 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-10 09:31:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:45,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:31:45,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:45,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:31:45,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451378328] [2024-11-10 09:31:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451378328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:31:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502523208] [2024-11-10 09:31:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:45,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:31:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:45,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:31:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:31:45,379 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:45,421 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-10 09:31:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:31:45,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-10 09:31:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:45,422 INFO L225 Difference]: With dead ends: 136 [2024-11-10 09:31:45,423 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 09:31:45,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-10 09:31:45,424 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:45,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:31:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 09:31:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-10 09:31:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-10 09:31:45,435 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 62 [2024-11-10 09:31:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:45,437 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-10 09:31:45,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-10 09:31:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 09:31:45,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:45,438 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:45,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 09:31:45,639 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-10 09:31:45,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1881917894, now seen corresponding path program 1 times [2024-11-10 09:31:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436121201] [2024-11-10 09:31:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:45,644 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-10 09:31:45,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:45,646 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-10 09:31:45,647 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-10 09:31:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:45,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:31:45,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:45,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:31:45,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436121201] [2024-11-10 09:31:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436121201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:31:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974509888] [2024-11-10 09:31:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:31:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:31:45,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:31:45,857 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:45,936 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2024-11-10 09:31:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:31:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-10 09:31:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:45,938 INFO L225 Difference]: With dead ends: 144 [2024-11-10 09:31:45,938 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 09:31:45,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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-10 09:31:45,939 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:45,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 491 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 09:31:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-10 09:31:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 09:31:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-10 09:31:45,944 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 62 [2024-11-10 09:31:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-10 09:31:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-10 09:31:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 09:31:45,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:45,945 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:45,952 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-10 09:31:46,149 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-10 09:31:46,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1853288743, now seen corresponding path program 1 times [2024-11-10 09:31:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410782663] [2024-11-10 09:31:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:46,151 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-10 09:31:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:46,157 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-10 09:31:46,158 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-10 09:31:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:46,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 09:31:46,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:47,821 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-10 09:31:47,847 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 17 treesize of output 17 [2024-11-10 09:31:47,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:31:47,916 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 54 treesize of output 30 [2024-11-10 09:31:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:31:47,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:31:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:48,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410782663] [2024-11-10 09:31:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410782663] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:31:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:31:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-10 09:31:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521487893] [2024-11-10 09:31:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:31:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:31:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:31:48,040 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:48,195 INFO L93 Difference]: Finished difference Result 169 states and 227 transitions. [2024-11-10 09:31:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:31:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-10 09:31:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:48,196 INFO L225 Difference]: With dead ends: 169 [2024-11-10 09:31:48,196 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:31:48,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:31:48,197 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 66 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 347 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-10 09:31:48,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 347 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:31:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-10 09:31:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 85 states have internal predecessors, (110), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:31:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-10 09:31:48,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 62 [2024-11-10 09:31:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-10 09:31:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-10 09:31:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:48,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:48,217 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:48,224 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 (5)] Ended with exit code 0 [2024-11-10 09:31:48,417 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-10 09:31:48,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -458402884, now seen corresponding path program 1 times [2024-11-10 09:31:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269483283] [2024-11-10 09:31:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:48,419 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-10 09:31:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:48,423 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-10 09:31:48,424 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-10 09:31:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:48,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 09:31:48,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:48,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-10 09:31:48,960 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 24 treesize of output 12 [2024-11-10 09:31:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-10 09:31:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:49,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:31:49,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269483283] [2024-11-10 09:31:49,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269483283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:49,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:49,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:31:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265739838] [2024-11-10 09:31:49,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:49,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:31:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:31:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:31:49,024 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:49,173 INFO L93 Difference]: Finished difference Result 175 states and 231 transitions. [2024-11-10 09:31:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:31:49,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-10 09:31:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:49,175 INFO L225 Difference]: With dead ends: 175 [2024-11-10 09:31:49,175 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:31:49,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:31:49,176 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 192 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:49,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 314 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:31:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:31:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-10 09:31:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 85 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 09:31:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-11-10 09:31:49,183 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 64 [2024-11-10 09:31:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:49,183 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-11-10 09:31:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-10 09:31:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:49,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:49,184 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:49,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 09:31:49,388 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-10 09:31:49,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -261889379, now seen corresponding path program 1 times [2024-11-10 09:31:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107238953] [2024-11-10 09:31:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:49,391 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-10 09:31:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:49,393 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-10 09:31:49,394 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-10 09:31:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:49,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 09:31:49,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:50,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-10 09:31:50,689 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-10 09:31:51,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:31:51,144 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 307 treesize of output 131 [2024-11-10 09:31:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:31:51,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:31:51,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107238953] [2024-11-10 09:31:51,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107238953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:31:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299108973] [2024-11-10 09:31:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:31:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:31:51,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:31:51,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-10 09:31:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:52,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 09:31:52,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:52,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-10 09:31:54,259 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 166 treesize of output 100 [2024-11-10 09:31:54,731 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 0 case distinctions, treesize of input 296 treesize of output 148 [2024-11-10 09:31:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:31:54,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:31:55,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1299108973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:31:55,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:31:55,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-10 09:31:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637757761] [2024-11-10 09:31:55,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:31:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:31:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:31:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:31:55,104 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 09:31:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:56,796 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2024-11-10 09:31:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:31:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 64 [2024-11-10 09:31:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:56,800 INFO L225 Difference]: With dead ends: 257 [2024-11-10 09:31:56,800 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 09:31:56,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:31:56,801 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 352 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:56,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 667 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 09:31:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 09:31:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2024-11-10 09:31:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 157 states have internal predecessors, (199), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:31:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2024-11-10 09:31:56,818 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 64 [2024-11-10 09:31:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:56,818 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2024-11-10 09:31:56,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 09:31:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2024-11-10 09:31:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:56,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:56,819 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:56,830 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-10 09:31:57,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-10 09:31:57,223 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 09:31:57,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -329320165, now seen corresponding path program 1 times [2024-11-10 09:31:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162251588] [2024-11-10 09:31:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:57,225 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-10 09:31:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:57,228 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-10 09:31:57,229 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-10 09:31:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:57,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 09:31:57,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:31:57,863 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 26 treesize of output 14 [2024-11-10 09:31:57,883 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 17 treesize of output 13 [2024-11-10 09:31:57,917 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 49 treesize of output 40 [2024-11-10 09:31:58,071 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 91 treesize of output 75 [2024-11-10 09:31:58,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:31:58,080 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 76 treesize of output 48 [2024-11-10 09:31:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 09:31:58,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:31:58,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:31:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162251588] [2024-11-10 09:31:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162251588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:31:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:31:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:31:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680544182] [2024-11-10 09:31:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:31:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:31:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:31:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:31:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:31:58,172 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:31:58,979 INFO L93 Difference]: Finished difference Result 679 states and 877 transitions. [2024-11-10 09:31:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:31:58,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-10 09:31:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:31:58,983 INFO L225 Difference]: With dead ends: 679 [2024-11-10 09:31:58,983 INFO L226 Difference]: Without dead ends: 524 [2024-11-10 09:31:58,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:31:58,984 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 374 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:31:58,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 826 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:31:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-10 09:31:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 498. [2024-11-10 09:31:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 442 states have (on average 1.2737556561085972) internal successors, (563), 447 states have internal predecessors, (563), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 09:31:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 639 transitions. [2024-11-10 09:31:59,040 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 639 transitions. Word has length 64 [2024-11-10 09:31:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:31:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 639 transitions. [2024-11-10 09:31:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 09:31:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 639 transitions. [2024-11-10 09:31:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:31:59,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:31:59,042 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:31:59,053 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-10 09:31:59,242 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-10 09:31:59,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:31:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:31:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1927590842, now seen corresponding path program 1 times [2024-11-10 09:31:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:31:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478759268] [2024-11-10 09:31:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:31:59,245 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-10 09:31:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:31:59,248 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-10 09:31:59,249 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-10 09:31:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:31:59,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 09:31:59,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:32:00,366 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-10 09:32:00,366 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 26 treesize of output 21 [2024-11-10 09:32:00,415 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 17 treesize of output 13 [2024-11-10 09:32:00,750 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 28 [2024-11-10 09:32:00,968 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 28 [2024-11-10 09:32:01,205 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 45 treesize of output 33 [2024-11-10 09:32:01,217 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 09:32:01,218 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 59 treesize of output 35 [2024-11-10 09:32:01,224 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-10 09:32:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:32:01,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:32:24,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:32:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478759268] [2024-11-10 09:32:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478759268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:32:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592120158] [2024-11-10 09:32:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:32:24,437 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:32:24,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:32:24,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:32:24,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-10 09:32:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:32:25,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:32:25,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:32:29,617 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-10 09:32:31,345 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-11-10 09:32:31,346 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 26 treesize of output 21 [2024-11-10 09:32:31,851 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 17 treesize of output 13 [2024-11-10 09:32:32,997 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 28 [2024-11-10 09:32:33,750 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 28 [2024-11-10 09:32:34,726 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 45 treesize of output 33 [2024-11-10 09:32:34,746 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 09:32:34,746 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 59 treesize of output 35 [2024-11-10 09:32:34,773 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-10 09:32:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:32:34,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:32:48,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [592120158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:32:48,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:32:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-10 09:32:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016829322] [2024-11-10 09:32:48,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:32:48,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 09:32:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:32:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 09:32:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=528, Unknown=5, NotChecked=0, Total=650 [2024-11-10 09:32:48,472 INFO L87 Difference]: Start difference. First operand 498 states and 639 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 09:32:54,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:32:56,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:33:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:00,548 INFO L93 Difference]: Finished difference Result 962 states and 1233 transitions. [2024-11-10 09:33:00,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:33:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 64 [2024-11-10 09:33:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:00,551 INFO L225 Difference]: With dead ends: 962 [2024-11-10 09:33:00,551 INFO L226 Difference]: Without dead ends: 499 [2024-11-10 09:33:00,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=194, Invalid=671, Unknown=5, NotChecked=0, Total=870 [2024-11-10 09:33:00,553 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 561 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:00,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 781 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 333 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-11-10 09:33:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-10 09:33:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 492. [2024-11-10 09:33:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 436 states have (on average 1.268348623853211) internal successors, (553), 441 states have internal predecessors, (553), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 09:33:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 629 transitions. [2024-11-10 09:33:00,599 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 629 transitions. Word has length 64 [2024-11-10 09:33:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 629 transitions. [2024-11-10 09:33:00,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-10 09:33:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 629 transitions. [2024-11-10 09:33:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 09:33:00,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:00,601 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:33:00,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-10 09:33:00,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 09:33:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:33:01,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1445236676, now seen corresponding path program 1 times [2024-11-10 09:33:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:33:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680597409] [2024-11-10 09:33:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:01,011 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-10 09:33:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:33:01,012 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-10 09:33:01,013 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-10 09:33:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:01,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:33:01,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:33:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 09:33:01,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:33:01,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:33:01,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680597409] [2024-11-10 09:33:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680597409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:33:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104817403] [2024-11-10 09:33:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:01,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:33:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:33:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:33:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:33:01,257 INFO L87 Difference]: Start difference. First operand 492 states and 629 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:33:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:01,493 INFO L93 Difference]: Finished difference Result 958 states and 1224 transitions. [2024-11-10 09:33:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:33:01,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-10 09:33:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:01,496 INFO L225 Difference]: With dead ends: 958 [2024-11-10 09:33:01,496 INFO L226 Difference]: Without dead ends: 492 [2024-11-10 09:33:01,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:33:01,497 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:01,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:33:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-10 09:33:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2024-11-10 09:33:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 436 states have (on average 1.2591743119266054) internal successors, (549), 441 states have internal predecessors, (549), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 09:33:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 625 transitions. [2024-11-10 09:33:01,545 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 625 transitions. Word has length 64 [2024-11-10 09:33:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:01,546 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 625 transitions. [2024-11-10 09:33:01,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 09:33:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 625 transitions. [2024-11-10 09:33:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 09:33:01,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:01,547 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:33:01,557 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 (12)] Ended with exit code 0 [2024-11-10 09:33:01,751 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-10 09:33:01,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1891579841, now seen corresponding path program 1 times [2024-11-10 09:33:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:33:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440382215] [2024-11-10 09:33:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:01,753 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-10 09:33:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:33:01,755 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-10 09:33:01,757 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-10 09:33:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:02,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:33:02,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:33:03,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8