./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.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 16323610760e77773f8b1d5ae6c6da1ee6d03b17aca1fe300db59d44d2a0773d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:37:32,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:37:32,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:37:32,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:37:32,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:37:32,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:37:32,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:37:32,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:37:32,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:37:32,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:37:32,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:37:32,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:37:32,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:37:32,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:37:32,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:37:32,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:37:32,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:37:32,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:37:32,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:37:32,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:37:32,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:37:32,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:37:32,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:37:32,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:37:32,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:37:32,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:37:32,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:37:32,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:37:32,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:37:32,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:37:32,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:37:32,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:37:32,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:37:32,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:37:32,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:37:32,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:37:32,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:37:32,511 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 -> 16323610760e77773f8b1d5ae6c6da1ee6d03b17aca1fe300db59d44d2a0773d [2024-11-20 08:37:32,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:37:32,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:37:32,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:37:32,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:37:32,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:37:32,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:33,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:37:34,076 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:37:34,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:34,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9d83f74/4beb547536524301b957105c0d8b34ea/FLAG84dabc7e3 [2024-11-20 08:37:34,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d9d83f74/4beb547536524301b957105c0d8b34ea [2024-11-20 08:37:34,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:37:34,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:37:34,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:37:34,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:37:34,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:37:34,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e92ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34, skipping insertion in model container [2024-11-20 08:37:34,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:37:34,249 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-57.i[917,930] [2024-11-20 08:37:34,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:37:34,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:37:34,331 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-57.i[917,930] [2024-11-20 08:37:34,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:37:34,382 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:37:34,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34 WrapperNode [2024-11-20 08:37:34,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:37:34,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:37:34,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:37:34,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:37:34,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,426 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2024-11-20 08:37:34,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:37:34,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:37:34,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:37:34,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:37:34,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,456 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-11-20 08:37:34,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:37:34,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:37:34,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:37:34,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:37:34,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (1/1) ... [2024-11-20 08:37:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:37:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:37:34,502 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-20 08:37:34,503 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-20 08:37:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:37:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:37:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:37:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:37:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:37:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:37:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:37:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:37:34,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:37:34,640 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:37:34,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:37:34,970 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-20 08:37:34,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:37:34,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:37:34,984 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:37:34,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:34 BoogieIcfgContainer [2024-11-20 08:37:34,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:37:34,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:37:34,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:37:34,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:37:34,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:37:34" (1/3) ... [2024-11-20 08:37:34,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0d3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:34, skipping insertion in model container [2024-11-20 08:37:34,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:34" (2/3) ... [2024-11-20 08:37:34,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0d3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:34, skipping insertion in model container [2024-11-20 08:37:34,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:34" (3/3) ... [2024-11-20 08:37:34,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:35,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:37:35,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:37:35,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:37:35,056 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;@48f3e020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:37:35,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:37:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:37:35,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:35,070 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:35,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:35,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1840313941, now seen corresponding path program 1 times [2024-11-20 08:37:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758243935] [2024-11-20 08:37:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758243935] [2024-11-20 08:37:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758243935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:37:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012464313] [2024-11-20 08:37:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:37:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:37:35,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:37:35,441 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:35,462 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-20 08:37:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:37:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-20 08:37:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:35,469 INFO L225 Difference]: With dead ends: 187 [2024-11-20 08:37:35,469 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 08:37:35,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-20 08:37:35,475 INFO L432 NwaCegarLoop]: 135 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, 135 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-20 08:37:35,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 08:37:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 08:37:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-20 08:37:35,561 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-20 08:37:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-20 08:37:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-20 08:37:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:37:35,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:35,566 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:37:35,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash -957014791, now seen corresponding path program 1 times [2024-11-20 08:37:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50869323] [2024-11-20 08:37:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50869323] [2024-11-20 08:37:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50869323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:37:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58289612] [2024-11-20 08:37:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:35,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:37:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:37:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:37:35,891 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:35,933 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-11-20 08:37:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:37:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-20 08:37:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:35,935 INFO L225 Difference]: With dead ends: 186 [2024-11-20 08:37:35,935 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 08:37:35,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-20 08:37:35,936 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 08:37:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-20 08:37:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-20 08:37:35,954 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 134 [2024-11-20 08:37:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:35,955 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-20 08:37:35,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-20 08:37:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:37:35,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:35,958 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:37:35,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -955167749, now seen corresponding path program 1 times [2024-11-20 08:37:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524813867] [2024-11-20 08:37:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524813867] [2024-11-20 08:37:36,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524813867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:36,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:36,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:36,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699364466] [2024-11-20 08:37:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:36,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:36,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:36,322 INFO L87 Difference]: Start difference. First operand 95 states and 137 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:36,408 INFO L93 Difference]: Finished difference Result 236 states and 343 transitions. [2024-11-20 08:37:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:36,409 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-20 08:37:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:36,411 INFO L225 Difference]: With dead ends: 236 [2024-11-20 08:37:36,411 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 08:37:36,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:37:36,412 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 60 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:36,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 554 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 08:37:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2024-11-20 08:37:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-11-20 08:37:36,420 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 134 [2024-11-20 08:37:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-11-20 08:37:36,420 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-11-20 08:37:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 08:37:36,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:36,422 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:37:36,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1223337891, now seen corresponding path program 1 times [2024-11-20 08:37:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936207874] [2024-11-20 08:37:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936207874] [2024-11-20 08:37:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936207874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:36,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:37:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063029138] [2024-11-20 08:37:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:36,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:37:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:37:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:37:36,552 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:36,570 INFO L93 Difference]: Finished difference Result 259 states and 377 transitions. [2024-11-20 08:37:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:37:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-20 08:37:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:36,576 INFO L225 Difference]: With dead ends: 259 [2024-11-20 08:37:36,576 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 08:37:36,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:37:36,578 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:36,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 300 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 08:37:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2024-11-20 08:37:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-20 08:37:36,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 136 [2024-11-20 08:37:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-20 08:37:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-20 08:37:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 08:37:36,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:36,593 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:36,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:37:36,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1896205134, now seen corresponding path program 1 times [2024-11-20 08:37:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967970126] [2024-11-20 08:37:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967970126] [2024-11-20 08:37:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967970126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:36,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7788375] [2024-11-20 08:37:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:36,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:36,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:36,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:36,850 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:37,091 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2024-11-20 08:37:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:37:37,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2024-11-20 08:37:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:37,093 INFO L225 Difference]: With dead ends: 312 [2024-11-20 08:37:37,093 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 08:37:37,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:37,095 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 113 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:37,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 408 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:37:37,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 08:37:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2024-11-20 08:37:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-11-20 08:37:37,114 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 137 [2024-11-20 08:37:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:37,115 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-11-20 08:37:37,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-11-20 08:37:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:37:37,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:37,117 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:37:37,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1705869233, now seen corresponding path program 1 times [2024-11-20 08:37:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799901507] [2024-11-20 08:37:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:37,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799901507] [2024-11-20 08:37:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799901507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:37,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:37:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140473985] [2024-11-20 08:37:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:37,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:37:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:37:37,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:37,432 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:37,528 INFO L93 Difference]: Finished difference Result 313 states and 450 transitions. [2024-11-20 08:37:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:37:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-20 08:37:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:37,530 INFO L225 Difference]: With dead ends: 313 [2024-11-20 08:37:37,530 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 08:37:37,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:37:37,531 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 56 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:37,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 622 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 08:37:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 174. [2024-11-20 08:37:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 250 transitions. [2024-11-20 08:37:37,545 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 250 transitions. Word has length 141 [2024-11-20 08:37:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:37,546 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 250 transitions. [2024-11-20 08:37:37,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 250 transitions. [2024-11-20 08:37:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:37:37,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:37,547 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:37,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:37:37,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1447703795, now seen corresponding path program 1 times [2024-11-20 08:37:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:37,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394352117] [2024-11-20 08:37:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394352117] [2024-11-20 08:37:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394352117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:37,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:37:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480678020] [2024-11-20 08:37:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:37,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:37:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:37,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:37:37,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:37:37,840 INFO L87 Difference]: Start difference. First operand 174 states and 250 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:37,936 INFO L93 Difference]: Finished difference Result 329 states and 474 transitions. [2024-11-20 08:37:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:37:37,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-20 08:37:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:37,938 INFO L225 Difference]: With dead ends: 329 [2024-11-20 08:37:37,939 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 08:37:37,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:37:37,940 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 169 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:37,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 658 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 08:37:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 153. [2024-11-20 08:37:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-20 08:37:37,954 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 141 [2024-11-20 08:37:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:37,955 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-20 08:37:37,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-20 08:37:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:37,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:37,957 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:37,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:37:37,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:37,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1643005562, now seen corresponding path program 1 times [2024-11-20 08:37:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886549597] [2024-11-20 08:37:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886549597] [2024-11-20 08:37:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886549597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389444972] [2024-11-20 08:37:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:38,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:38,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:38,285 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:38,368 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2024-11-20 08:37:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 08:37:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:38,370 INFO L225 Difference]: With dead ends: 309 [2024-11-20 08:37:38,370 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 08:37:38,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:38,370 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:38,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 469 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 08:37:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2024-11-20 08:37:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 124 states have internal predecessors, (161), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 233 transitions. [2024-11-20 08:37:38,385 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 233 transitions. Word has length 144 [2024-11-20 08:37:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:38,386 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 233 transitions. [2024-11-20 08:37:38,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 233 transitions. [2024-11-20 08:37:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:38,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:38,387 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:37:38,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1861860280, now seen corresponding path program 1 times [2024-11-20 08:37:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149924229] [2024-11-20 08:37:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149924229] [2024-11-20 08:37:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149924229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135244726] [2024-11-20 08:37:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:38,633 INFO L87 Difference]: Start difference. First operand 163 states and 233 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:38,700 INFO L93 Difference]: Finished difference Result 321 states and 462 transitions. [2024-11-20 08:37:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:37:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 08:37:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:38,702 INFO L225 Difference]: With dead ends: 321 [2024-11-20 08:37:38,702 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 08:37:38,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:38,702 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:38,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 479 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 08:37:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 184. [2024-11-20 08:37:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2024-11-20 08:37:38,711 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 144 [2024-11-20 08:37:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:38,711 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2024-11-20 08:37:38,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2024-11-20 08:37:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:38,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:38,712 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:37:38,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1732042438, now seen corresponding path program 1 times [2024-11-20 08:37:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873844359] [2024-11-20 08:37:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873844359] [2024-11-20 08:37:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873844359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:37:39,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121991318] [2024-11-20 08:37:39,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:39,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:37:39,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:37:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:37:39,962 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:40,331 INFO L93 Difference]: Finished difference Result 391 states and 558 transitions. [2024-11-20 08:37:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:37:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 08:37:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:40,334 INFO L225 Difference]: With dead ends: 391 [2024-11-20 08:37:40,334 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 08:37:40,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:37:40,335 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 274 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:40,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 677 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:37:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 08:37:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-11-20 08:37:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 205 states have (on average 1.3219512195121952) internal successors, (271), 206 states have internal predecessors, (271), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 355 transitions. [2024-11-20 08:37:40,355 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 355 transitions. Word has length 144 [2024-11-20 08:37:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:40,356 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 355 transitions. [2024-11-20 08:37:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 355 transitions. [2024-11-20 08:37:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:40,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:40,357 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:40,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:37:40,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:40,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1641585567, now seen corresponding path program 1 times [2024-11-20 08:37:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976869608] [2024-11-20 08:37:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976869608] [2024-11-20 08:37:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976869608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839010392] [2024-11-20 08:37:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:40,534 INFO L87 Difference]: Start difference. First operand 251 states and 355 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:40,618 INFO L93 Difference]: Finished difference Result 575 states and 813 transitions. [2024-11-20 08:37:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:40,621 INFO L225 Difference]: With dead ends: 575 [2024-11-20 08:37:40,621 INFO L226 Difference]: Without dead ends: 371 [2024-11-20 08:37:40,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-20 08:37:40,622 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 81 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:40,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 530 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-20 08:37:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 272. [2024-11-20 08:37:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 226 states have (on average 1.336283185840708) internal successors, (302), 227 states have internal predecessors, (302), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 386 transitions. [2024-11-20 08:37:40,640 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 386 transitions. Word has length 145 [2024-11-20 08:37:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 386 transitions. [2024-11-20 08:37:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 386 transitions. [2024-11-20 08:37:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:40,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:40,642 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:37:40,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1267178335, now seen corresponding path program 1 times [2024-11-20 08:37:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973772320] [2024-11-20 08:37:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:40,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:40,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973772320] [2024-11-20 08:37:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973772320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:40,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:37:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997791522] [2024-11-20 08:37:40,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:40,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:37:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:37:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:40,854 INFO L87 Difference]: Start difference. First operand 272 states and 386 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:40,980 INFO L93 Difference]: Finished difference Result 582 states and 826 transitions. [2024-11-20 08:37:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:37:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:40,982 INFO L225 Difference]: With dead ends: 582 [2024-11-20 08:37:40,982 INFO L226 Difference]: Without dead ends: 357 [2024-11-20 08:37:40,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:37:40,983 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 73 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:40,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 823 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-20 08:37:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 298. [2024-11-20 08:37:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.3452380952380953) internal successors, (339), 253 states have internal predecessors, (339), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 423 transitions. [2024-11-20 08:37:41,012 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 423 transitions. Word has length 145 [2024-11-20 08:37:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:41,013 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 423 transitions. [2024-11-20 08:37:41,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 423 transitions. [2024-11-20 08:37:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:41,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:41,014 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:41,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:37:41,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1747925283, now seen corresponding path program 1 times [2024-11-20 08:37:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771332200] [2024-11-20 08:37:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771332200] [2024-11-20 08:37:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771332200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:41,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:41,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544935362] [2024-11-20 08:37:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:41,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:41,229 INFO L87 Difference]: Start difference. First operand 298 states and 423 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:41,303 INFO L93 Difference]: Finished difference Result 633 states and 893 transitions. [2024-11-20 08:37:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:41,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:41,306 INFO L225 Difference]: With dead ends: 633 [2024-11-20 08:37:41,306 INFO L226 Difference]: Without dead ends: 382 [2024-11-20 08:37:41,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:41,307 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 49 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:41,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 486 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-20 08:37:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 313. [2024-11-20 08:37:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 267 states have (on average 1.344569288389513) internal successors, (359), 268 states have internal predecessors, (359), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 443 transitions. [2024-11-20 08:37:41,324 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 443 transitions. Word has length 145 [2024-11-20 08:37:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:41,325 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 443 transitions. [2024-11-20 08:37:41,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 443 transitions. [2024-11-20 08:37:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:41,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:41,326 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:37:41,326 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1845977435, now seen corresponding path program 1 times [2024-11-20 08:37:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892999744] [2024-11-20 08:37:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:41,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892999744] [2024-11-20 08:37:41,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892999744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:41,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:41,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:41,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671476883] [2024-11-20 08:37:41,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:41,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:41,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:41,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:41,532 INFO L87 Difference]: Start difference. First operand 313 states and 443 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:41,602 INFO L93 Difference]: Finished difference Result 596 states and 843 transitions. [2024-11-20 08:37:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:41,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:41,604 INFO L225 Difference]: With dead ends: 596 [2024-11-20 08:37:41,604 INFO L226 Difference]: Without dead ends: 302 [2024-11-20 08:37:41,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:41,605 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 44 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:41,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 491 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-20 08:37:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2024-11-20 08:37:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 237 states have (on average 1.3080168776371308) internal successors, (310), 238 states have internal predecessors, (310), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 394 transitions. [2024-11-20 08:37:41,623 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 394 transitions. Word has length 145 [2024-11-20 08:37:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 394 transitions. [2024-11-20 08:37:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2024-11-20 08:37:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:41,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:41,624 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:37:41,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:41,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1244546081, now seen corresponding path program 1 times [2024-11-20 08:37:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411159919] [2024-11-20 08:37:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411159919] [2024-11-20 08:37:41,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411159919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068821052] [2024-11-20 08:37:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:41,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:41,818 INFO L87 Difference]: Start difference. First operand 283 states and 394 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:41,889 INFO L93 Difference]: Finished difference Result 603 states and 836 transitions. [2024-11-20 08:37:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:41,891 INFO L225 Difference]: With dead ends: 603 [2024-11-20 08:37:41,891 INFO L226 Difference]: Without dead ends: 367 [2024-11-20 08:37:41,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:41,892 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:41,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 542 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-20 08:37:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 289. [2024-11-20 08:37:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 243 states have (on average 1.300411522633745) internal successors, (316), 244 states have internal predecessors, (316), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 400 transitions. [2024-11-20 08:37:41,912 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 400 transitions. Word has length 145 [2024-11-20 08:37:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 400 transitions. [2024-11-20 08:37:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 400 transitions. [2024-11-20 08:37:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:37:41,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:41,914 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:41,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:37:41,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1056276509, now seen corresponding path program 1 times [2024-11-20 08:37:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694126692] [2024-11-20 08:37:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:37:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:37:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:37:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:37:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:37:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:37:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:37:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:37:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:37:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:37:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:37:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:37:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:37:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:37:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:37:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:37:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:37:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:37:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:37:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694126692] [2024-11-20 08:37:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694126692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916856151] [2024-11-20 08:37:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:42,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:37:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:42,114 INFO L87 Difference]: Start difference. First operand 289 states and 400 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:42,182 INFO L93 Difference]: Finished difference Result 570 states and 786 transitions. [2024-11-20 08:37:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:37:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:37:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:42,184 INFO L225 Difference]: With dead ends: 570 [2024-11-20 08:37:42,184 INFO L226 Difference]: Without dead ends: 328 [2024-11-20 08:37:42,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:37:42,185 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 57 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:42,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 543 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-20 08:37:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 273. [2024-11-20 08:37:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 227 states have (on average 1.2863436123348018) internal successors, (292), 228 states have internal predecessors, (292), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:37:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2024-11-20 08:37:42,204 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 145 [2024-11-20 08:37:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:42,205 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2024-11-20 08:37:42,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2024-11-20 08:37:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 08:37:42,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:42,206 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:42,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:37:42,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2144036769, now seen corresponding path program 1 times [2024-11-20 08:37:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:37:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848115163] [2024-11-20 08:37:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:37:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:37:42,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:37:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:37:42,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:37:42,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:37:42,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:37:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:37:42,415 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:37:42,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:37:42,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:37:42 BoogieIcfgContainer [2024-11-20 08:37:42,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:37:42,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:37:42,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:37:42,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:37:42,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:34" (3/4) ... [2024-11-20 08:37:42,525 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:37:42,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:37:42,526 INFO L158 Benchmark]: Toolchain (without parser) took 8430.25ms. Allocated memory was 155.2MB in the beginning and 388.0MB in the end (delta: 232.8MB). Free memory was 84.5MB in the beginning and 282.9MB in the end (delta: -198.4MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.16ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 84.4MB in the beginning and 182.8MB in the end (delta: -98.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.42ms. Allocated memory is still 213.9MB. Free memory was 182.8MB in the beginning and 179.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: Boogie Preprocessor took 48.86ms. Allocated memory is still 213.9MB. Free memory was 179.6MB in the beginning and 175.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: RCFGBuilder took 508.93ms. Allocated memory is still 213.9MB. Free memory was 175.4MB in the beginning and 140.8MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,527 INFO L158 Benchmark]: TraceAbstraction took 7535.48ms. Allocated memory was 213.9MB in the beginning and 388.0MB in the end (delta: 174.1MB). Free memory was 139.8MB in the beginning and 284.0MB in the end (delta: -144.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-20 08:37:42,528 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 388.0MB. Free memory is still 282.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:37:42,528 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.16ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 84.4MB in the beginning and 182.8MB in the end (delta: -98.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.42ms. Allocated memory is still 213.9MB. Free memory was 182.8MB in the beginning and 179.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.86ms. Allocated memory is still 213.9MB. Free memory was 179.6MB in the beginning and 175.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 508.93ms. Allocated memory is still 213.9MB. Free memory was 175.4MB in the beginning and 140.8MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7535.48ms. Allocated memory was 213.9MB in the beginning and 388.0MB in the end (delta: 174.1MB). Free memory was 139.8MB in the beginning and 284.0MB in the end (delta: -144.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 388.0MB. Free memory is still 282.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28-L30] float float_Array_0[1] = { 63.5 }; [L28-L30] float float_Array_0[1] = { 63.5 }; [L31] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L32-L34] signed char signed_char_Array_0[2][2][2] = { {{32, -4}, {32, -64}}, {{64, 16}, {4, 50}} }; [L35] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0][0][0]); [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1][0][0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[0][1][0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[1][1][0]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer = &(signed_char_Array_0[0][0][1]); [L40] signed char* signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer = &(signed_char_Array_0[1][0][1]); [L41] signed char* signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer = &(signed_char_Array_0[0][1][1]); [L42] signed char* signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer = &(signed_char_Array_0[1][1][1]); [L43-L45] signed long int signed_long_int_Array_0[1] = { 1 }; [L43-L45] signed long int signed_long_int_Array_0[1] = { 1 }; [L46] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L47] signed char last_1_signed_char_Array_0_1__0__0_ = 64; [L48] signed char last_1_signed_char_Array_0_0__1__1_ = -64; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=0, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L109] EXPR signed_char_Array_0[1][0][0] [L109] last_1_signed_char_Array_0_1__0__0_ = signed_char_Array_0[1][0][0] [L110] EXPR signed_char_Array_0[0][1][1] [L110] last_1_signed_char_Array_0_0__1__1_ = signed_char_Array_0[0][1][1] [L120] RET updateLastVariables() [L121] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L83] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L85] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L86] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L87] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L88] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L89] signed_char_Array_0[0][0][0] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[0][0][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L91] EXPR signed_char_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[0][0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L92] signed_char_Array_0[0][1][0] = __VERIFIER_nondet_char() [L93] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L94] EXPR signed_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L94] CALL assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L94] RET assume_abort_if_not(signed_char_Array_0[0][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L95] signed_char_Array_0[1][1][0] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L96] RET assume_abort_if_not(signed_char_Array_0[1][1][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L97] EXPR signed_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L97] CALL assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L97] RET assume_abort_if_not(signed_char_Array_0[1][1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L98] signed_char_Array_0[0][0][1] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L99] RET assume_abort_if_not(signed_char_Array_0[0][0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L100] EXPR signed_char_Array_0[0][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L100] RET assume_abort_if_not(signed_char_Array_0[0][0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L101] signed_char_Array_0[1][0][1] = __VERIFIER_nondet_char() [L102] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L102] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L102] RET assume_abort_if_not(signed_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L103] EXPR signed_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L103] CALL assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L103] RET assume_abort_if_not(signed_char_Array_0[1][0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L104] signed_char_Array_0[1][1][1] = __VERIFIER_nondet_char() [L105] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L105] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L105] RET assume_abort_if_not(signed_char_Array_0[1][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L106] EXPR signed_char_Array_0[1][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L106] CALL assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L106] RET assume_abort_if_not(signed_char_Array_0[1][1][1] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L121] RET updateVariables() [L122] CALL step() [L52] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L52] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)); [L53] COND TRUE ! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_) [L54] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L54] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-255] [L54] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L54] COND TRUE ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && stepLocal_0 [L55] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L62] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer) [L62] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer) [L62] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L62] EXPR ((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L62] EXPR ((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L62] signed long int stepLocal_3 = ((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))); [L63] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L63] COND TRUE (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < stepLocal_3 [L64] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer) [L64] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L64] (*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) = ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L68] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = 128.91f [L69] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer) [L69] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L69] unsigned char stepLocal_2 = (*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L70] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L70] unsigned char stepLocal_1 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)); [L71] stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_2=0] [L71] stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L71] COND FALSE !(stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) [L76] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L76] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L76] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L113] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L113] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L113] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L113] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) [L113] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L113] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) [L113] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L113] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L113] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))))))) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L113] EXPR ((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer) [L113] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L113] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR (((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) 128.91f)) [L113] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L113] EXPR ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) 128.91f)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L113-L114] return ((((! (last_1_signed_char_Array_0_0__1__1_ >= last_1_signed_char_Array_0_1__0__0_)) ? ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((last_1_signed_char_Array_0_1__0__0_) < (last_1_signed_char_Array_0_0__1__1_)) ? (last_1_signed_char_Array_0_1__0__0_) : (last_1_signed_char_Array_0_0__1__1_))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) last_1_signed_char_Array_0_0__1__1_))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer)) + (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - ((((64) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? (64) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) ((64 - (*(signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer))) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) 128.91f)) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, isInitial=1, last_1_signed_char_Array_0_0__1__1_=-64, last_1_signed_char_Array_0_1__0__0_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:4}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:6}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var5_Pointer={6:5}, signed_char_Array_0_arraysigned_char_Array_0Var6_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var7_Pointer={6:7}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1196 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1196 mSDsluCounter, 8104 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5791 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1256 IncrementalHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 2313 mSDtfsCounter, 1256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=13, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 646 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2406 NumberOfCodeBlocks, 2406 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2243 ConstructedInterpolants, 0 QuantifiedInterpolants, 5497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 9792/9792 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-20 08:37:42,552 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.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 16323610760e77773f8b1d5ae6c6da1ee6d03b17aca1fe300db59d44d2a0773d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:37:44,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:37:44,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:37:44,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:37:44,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:37:44,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:37:44,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:37:44,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:37:44,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:37:44,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:37:44,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:37:44,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:37:44,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:37:44,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:37:44,387 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:37:44,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:37:44,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:37:44,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:37:44,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:37:44,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:37:44,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:37:44,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:37:44,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:37:44,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:37:44,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:37:44,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:37:44,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:37:44,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:37:44,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:37:44,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:37:44,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:37:44,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:37:44,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:37:44,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:37:44,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:37:44,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:37:44,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:37:44,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:37:44,396 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:37:44,396 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:37:44,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:37:44,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:37:44,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:37:44,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:37:44,397 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 -> 16323610760e77773f8b1d5ae6c6da1ee6d03b17aca1fe300db59d44d2a0773d [2024-11-20 08:37:44,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:37:44,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:37:44,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:37:44,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:37:44,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:37:44,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:45,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:37:46,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:37:46,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:46,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96824147/52c58563d7bd48c59fb012d58bdf4ae7/FLAG8110355d1 [2024-11-20 08:37:46,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96824147/52c58563d7bd48c59fb012d58bdf4ae7 [2024-11-20 08:37:46,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:37:46,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:37:46,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:37:46,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:37:46,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:37:46,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2d668e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46, skipping insertion in model container [2024-11-20 08:37:46,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:37:46,205 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-57.i[917,930] [2024-11-20 08:37:46,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:37:46,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:37:46,294 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-57.i[917,930] [2024-11-20 08:37:46,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:37:46,370 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:37:46,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46 WrapperNode [2024-11-20 08:37:46,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:37:46,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:37:46,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:37:46,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:37:46,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,440 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2024-11-20 08:37:46,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:37:46,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:37:46,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:37:46,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:37:46,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,467 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 24, 3, 72, 9]. 65 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 3, 1, 8, 1]. The 17 writes are split as follows [0, 3, 1, 10, 3]. [2024-11-20 08:37:46,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:37:46,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:37:46,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:37:46,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:37:46,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (1/1) ... [2024-11-20 08:37:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:37:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:37:46,532 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-20 08:37:46,534 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-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:37:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:37:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:37:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:37:46,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:37:46,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:37:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 08:37:46,700 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:37:46,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:37:47,099 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-20 08:37:47,100 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:37:47,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:37:47,111 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:37:47,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:47 BoogieIcfgContainer [2024-11-20 08:37:47,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:37:47,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:37:47,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:37:47,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:37:47,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:37:46" (1/3) ... [2024-11-20 08:37:47,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:47, skipping insertion in model container [2024-11-20 08:37:47,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:37:46" (2/3) ... [2024-11-20 08:37:47,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:37:47, skipping insertion in model container [2024-11-20 08:37:47,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:37:47" (3/3) ... [2024-11-20 08:37:47,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-57.i [2024-11-20 08:37:47,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:37:47,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:37:47,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:37:47,179 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;@54f0e419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:37:47,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:37:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:37:47,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:47,191 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:47,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1840313941, now seen corresponding path program 1 times [2024-11-20 08:37:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:47,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464799584] [2024-11-20 08:37:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:47,204 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-20 08:37:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:47,206 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-20 08:37:47,224 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-20 08:37:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:47,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:37:47,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-20 08:37:47,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:37:47,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464799584] [2024-11-20 08:37:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464799584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:47,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:37:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154589658] [2024-11-20 08:37:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:47,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:37:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:47,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:37:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:37:47,521 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:47,542 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-20 08:37:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:37:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-20 08:37:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:47,548 INFO L225 Difference]: With dead ends: 187 [2024-11-20 08:37:47,548 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 08:37:47,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-20 08:37:47,554 INFO L432 NwaCegarLoop]: 135 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, 135 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-20 08:37:47,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 08:37:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 08:37:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:37:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-20 08:37:47,585 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-20 08:37:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-20 08:37:47,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:37:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-20 08:37:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 08:37:47,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:47,588 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:47,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:37:47,788 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-20 08:37:47,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -957014791, now seen corresponding path program 1 times [2024-11-20 08:37:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569570905] [2024-11-20 08:37:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:47,793 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-20 08:37:47,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:47,796 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-20 08:37:47,797 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-20 08:37:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:47,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:37:47,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:48,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:37:48,092 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 41 treesize of output 17 [2024-11-20 08:37:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:48,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:37:48,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569570905] [2024-11-20 08:37:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569570905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:37:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092930206] [2024-11-20 08:37:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:48,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:37:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:37:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:37:48,625 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:48,886 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-11-20 08:37:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:37:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-20 08:37:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:48,889 INFO L225 Difference]: With dead ends: 274 [2024-11-20 08:37:48,889 INFO L226 Difference]: Without dead ends: 184 [2024-11-20 08:37:48,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:48,893 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 94 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:48,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 322 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:37:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-20 08:37:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-20 08:37:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-20 08:37:48,912 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2024-11-20 08:37:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:48,912 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-20 08:37:48,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-20 08:37:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:37:48,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:48,914 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:48,920 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-20 08:37:49,115 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-20 08:37:49,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:49,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1707716275, now seen corresponding path program 1 times [2024-11-20 08:37:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211845316] [2024-11-20 08:37:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:49,116 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-20 08:37:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:49,139 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-20 08:37:49,140 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-20 08:37:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:49,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:37:49,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-20 08:37:49,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:37:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:49,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211845316] [2024-11-20 08:37:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211845316] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:37:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:37:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-20 08:37:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205051916] [2024-11-20 08:37:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:37:49,783 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:49,868 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2024-11-20 08:37:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:37:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-20 08:37:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:49,872 INFO L225 Difference]: With dead ends: 309 [2024-11-20 08:37:49,872 INFO L226 Difference]: Without dead ends: 217 [2024-11-20 08:37:49,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:37:49,873 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 128 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:49,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 360 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-20 08:37:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 173. [2024-11-20 08:37:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.335820895522388) internal successors, (179), 134 states have internal predecessors, (179), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2024-11-20 08:37:49,900 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 141 [2024-11-20 08:37:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2024-11-20 08:37:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2024-11-20 08:37:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:37:49,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:49,904 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:49,912 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-20 08:37:50,105 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-20 08:37:50,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 898307279, now seen corresponding path program 1 times [2024-11-20 08:37:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909206420] [2024-11-20 08:37:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:50,106 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-20 08:37:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:50,111 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-20 08:37:50,113 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-20 08:37:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:50,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:37:50,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:50,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:37:50,295 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 41 treesize of output 17 [2024-11-20 08:37:50,607 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-20 08:37:50,699 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 66 treesize of output 54 [2024-11-20 08:37:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:50,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:37:50,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909206420] [2024-11-20 08:37:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909206420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:50,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:50,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:37:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267429005] [2024-11-20 08:37:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:50,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:37:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:37:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:37:50,727 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:51,128 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2024-11-20 08:37:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:37:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-20 08:37:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:51,130 INFO L225 Difference]: With dead ends: 304 [2024-11-20 08:37:51,130 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 08:37:51,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:37:51,132 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 138 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:51,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 629 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:37:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 08:37:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 180. [2024-11-20 08:37:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 261 transitions. [2024-11-20 08:37:51,157 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 261 transitions. Word has length 141 [2024-11-20 08:37:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:51,157 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 261 transitions. [2024-11-20 08:37:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 261 transitions. [2024-11-20 08:37:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:51,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:51,161 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:51,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:37:51,361 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-20 08:37:51,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1860013238, now seen corresponding path program 1 times [2024-11-20 08:37:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417948057] [2024-11-20 08:37:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:51,363 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-20 08:37:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:51,365 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-20 08:37:51,366 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-20 08:37:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:51,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:37:51,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:51,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:37:51,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417948057] [2024-11-20 08:37:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417948057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:37:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689816729] [2024-11-20 08:37:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:51,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:37:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:37:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:37:51,571 INFO L87 Difference]: Start difference. First operand 180 states and 261 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:51,668 INFO L93 Difference]: Finished difference Result 333 states and 484 transitions. [2024-11-20 08:37:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:37:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 08:37:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:51,672 INFO L225 Difference]: With dead ends: 333 [2024-11-20 08:37:51,672 INFO L226 Difference]: Without dead ends: 221 [2024-11-20 08:37:51,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:37:51,674 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 33 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:51,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 475 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:37:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-20 08:37:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2024-11-20 08:37:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.343558282208589) internal successors, (219), 163 states have internal predecessors, (219), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2024-11-20 08:37:51,692 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 144 [2024-11-20 08:37:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2024-11-20 08:37:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2024-11-20 08:37:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:51,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:51,695 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:51,701 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-20 08:37:51,896 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-20 08:37:51,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1733889480, now seen corresponding path program 1 times [2024-11-20 08:37:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773881756] [2024-11-20 08:37:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:51,897 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-20 08:37:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:51,899 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-20 08:37:51,900 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-20 08:37:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:52,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:37:52,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:37:52,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:37:52,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:37:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773881756] [2024-11-20 08:37:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773881756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:37:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:37:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:37:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27227182] [2024-11-20 08:37:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:37:52,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:37:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:37:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:37:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:37:52,058 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:37:52,077 INFO L93 Difference]: Finished difference Result 317 states and 459 transitions. [2024-11-20 08:37:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:37:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-20 08:37:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:37:52,079 INFO L225 Difference]: With dead ends: 317 [2024-11-20 08:37:52,079 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 08:37:52,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 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-20 08:37:52,080 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:37:52,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:37:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 08:37:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2024-11-20 08:37:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 08:37:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2024-11-20 08:37:52,092 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 144 [2024-11-20 08:37:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:37:52,093 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2024-11-20 08:37:52,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:37:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2024-11-20 08:37:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:37:52,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:37:52,095 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:37:52,101 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-20 08:37:52,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:37:52,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:37:52,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:37:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1732042438, now seen corresponding path program 1 times [2024-11-20 08:37:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:37:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288811883] [2024-11-20 08:37:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:37:52,296 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-20 08:37:52,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:37:52,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:37:52,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 08:37:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:37:52,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 08:37:52,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:37:53,389 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-20 08:37:53,650 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-20 08:37:53,885 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-20 08:37:54,204 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 21 treesize of output 20 [2024-11-20 08:37:54,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-20 08:37:54,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-20 08:37:55,477 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2024-11-20 08:37:55,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 85 [2024-11-20 08:37:55,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 96 [2024-11-20 08:37:56,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:37:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 141 treesize of output 81 [2024-11-20 08:37:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 128 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-20 08:37:56,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:38:08,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:38:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288811883] [2024-11-20 08:38:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288811883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:38:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [6302062] [2024-11-20 08:38:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:38:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:38:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:38:08,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:38:08,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-20 08:38:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:38:09,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 08:38:09,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:38:12,900 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-20 08:38:14,892 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 22 treesize of output 21 [2024-11-20 08:38:17,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-20 08:38:18,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-20 08:38:20,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-20 08:38:21,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-20 08:38:24,505 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-20 08:38:24,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 73 [2024-11-20 08:38:25,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2024-11-20 08:38:26,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 80 [2024-11-20 08:38:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 285 proven. 173 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-20 08:38:26,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:38:28,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [6302062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:38:28,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:38:28,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 26 [2024-11-20 08:38:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217997534] [2024-11-20 08:38:28,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:38:28,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 08:38:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:38:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 08:38:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=856, Unknown=3, NotChecked=0, Total=1056 [2024-11-20 08:38:28,478 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2024-11-20 08:38:36,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 08:38:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:38:53,102 INFO L93 Difference]: Finished difference Result 603 states and 834 transitions. [2024-11-20 08:38:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-20 08:38:53,104 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) Word has length 144 [2024-11-20 08:38:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:38:53,106 INFO L225 Difference]: With dead ends: 603 [2024-11-20 08:38:53,106 INFO L226 Difference]: Without dead ends: 489 [2024-11-20 08:38:53,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=1120, Invalid=3569, Unknown=3, NotChecked=0, Total=4692 [2024-11-20 08:38:53,109 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 2039 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:38:53,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 1021 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-20 08:38:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-20 08:38:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 349. [2024-11-20 08:38:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 296 states have (on average 1.347972972972973) internal successors, (399), 297 states have internal predecessors, (399), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:38:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 483 transitions. [2024-11-20 08:38:53,144 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 483 transitions. Word has length 144 [2024-11-20 08:38:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:38:53,144 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 483 transitions. [2024-11-20 08:38:53,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 11 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2024-11-20 08:38:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 483 transitions. [2024-11-20 08:38:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:38:53,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:38:53,145 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:38:53,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-20 08:38:53,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 08:38:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:38:53,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:38:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:38:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1641585567, now seen corresponding path program 1 times [2024-11-20 08:38:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:38:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720220191] [2024-11-20 08:38:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:38:53,547 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-20 08:38:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:38:53,551 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-20 08:38:53,552 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-20 08:38:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:38:53,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:38:53,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:38:53,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-20 08:38:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:38:53,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:38:53,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:38:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720220191] [2024-11-20 08:38:53,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720220191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:38:53,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:38:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:38:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354099669] [2024-11-20 08:38:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:38:53,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:38:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:38:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:38:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:38:53,867 INFO L87 Difference]: Start difference. First operand 349 states and 483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:38:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:38:57,930 INFO L93 Difference]: Finished difference Result 813 states and 1147 transitions. [2024-11-20 08:38:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:38:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:38:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:38:57,933 INFO L225 Difference]: With dead ends: 813 [2024-11-20 08:38:57,935 INFO L226 Difference]: Without dead ends: 587 [2024-11-20 08:38:57,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:38:57,936 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 83 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:38:57,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 540 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-20 08:38:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-20 08:38:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 417. [2024-11-20 08:38:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 364 states have (on average 1.370879120879121) internal successors, (499), 365 states have internal predecessors, (499), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:38:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 583 transitions. [2024-11-20 08:38:57,974 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 583 transitions. Word has length 145 [2024-11-20 08:38:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:38:57,974 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 583 transitions. [2024-11-20 08:38:57,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:38:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 583 transitions. [2024-11-20 08:38:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:38:57,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:38:57,975 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:38:57,983 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-20 08:38:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:38:58,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:38:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:38:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1267178335, now seen corresponding path program 1 times [2024-11-20 08:38:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:38:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554535482] [2024-11-20 08:38:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:38:58,177 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-20 08:38:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:38:58,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:38:58,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 08:38:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:38:58,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:38:58,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:38:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:38:58,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:38:58,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:38:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554535482] [2024-11-20 08:38:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554535482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:38:58,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:38:58,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:38:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882202285] [2024-11-20 08:38:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:38:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:38:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:38:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:38:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:38:58,561 INFO L87 Difference]: Start difference. First operand 417 states and 583 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:38:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:38:59,032 INFO L93 Difference]: Finished difference Result 833 states and 1175 transitions. [2024-11-20 08:38:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:38:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:38:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:38:59,036 INFO L225 Difference]: With dead ends: 833 [2024-11-20 08:38:59,036 INFO L226 Difference]: Without dead ends: 579 [2024-11-20 08:38:59,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:38:59,037 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:38:59,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 680 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:38:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-20 08:38:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 469. [2024-11-20 08:38:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 416 states have (on average 1.3798076923076923) internal successors, (574), 417 states have internal predecessors, (574), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:38:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 658 transitions. [2024-11-20 08:38:59,083 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 658 transitions. Word has length 145 [2024-11-20 08:38:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:38:59,086 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 658 transitions. [2024-11-20 08:38:59,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:38:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 658 transitions. [2024-11-20 08:38:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:38:59,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:38:59,089 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:38:59,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 08:38:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:38:59,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:38:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:38:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1747925283, now seen corresponding path program 1 times [2024-11-20 08:38:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:38:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138341041] [2024-11-20 08:38:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:38:59,290 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-20 08:38:59,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:38:59,291 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-20 08:38:59,292 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-20 08:38:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:38:59,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:38:59,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:39:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-20 08:39:01,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:39:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:39:01,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:39:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138341041] [2024-11-20 08:39:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138341041] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:39:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:39:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-20 08:39:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824946007] [2024-11-20 08:39:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:39:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:39:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:39:01,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:39:01,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:39:01,663 INFO L87 Difference]: Start difference. First operand 469 states and 658 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:39:02,040 INFO L93 Difference]: Finished difference Result 870 states and 1223 transitions. [2024-11-20 08:39:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:39:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:39:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:39:02,047 INFO L225 Difference]: With dead ends: 870 [2024-11-20 08:39:02,047 INFO L226 Difference]: Without dead ends: 602 [2024-11-20 08:39:02,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:39:02,051 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 102 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:39:02,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 379 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:39:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-20 08:39:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 525. [2024-11-20 08:39:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 472 states have (on average 1.38135593220339) internal successors, (652), 473 states have internal predecessors, (652), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:39:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 736 transitions. [2024-11-20 08:39:02,086 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 736 transitions. Word has length 145 [2024-11-20 08:39:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:39:02,086 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 736 transitions. [2024-11-20 08:39:02,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 736 transitions. [2024-11-20 08:39:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:39:02,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:39:02,090 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:39:02,097 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-20 08:39:02,290 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-20 08:39:02,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:39:02,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:39:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1845977435, now seen corresponding path program 1 times [2024-11-20 08:39:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:39:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225761319] [2024-11-20 08:39:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:39:02,292 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-20 08:39:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:39:02,294 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-20 08:39:02,295 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-20 08:39:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:39:02,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:39:02,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:39:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:39:02,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:39:02,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:39:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225761319] [2024-11-20 08:39:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225761319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:39:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:39:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:39:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614398009] [2024-11-20 08:39:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:39:02,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:39:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:39:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:39:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:39:02,630 INFO L87 Difference]: Start difference. First operand 525 states and 736 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:39:02,965 INFO L93 Difference]: Finished difference Result 843 states and 1188 transitions. [2024-11-20 08:39:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:39:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:39:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:39:02,969 INFO L225 Difference]: With dead ends: 843 [2024-11-20 08:39:02,969 INFO L226 Difference]: Without dead ends: 545 [2024-11-20 08:39:02,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:39:02,971 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 45 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 531 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.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:39:02,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 531 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:39:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-20 08:39:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 523. [2024-11-20 08:39:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 470 states have (on average 1.372340425531915) internal successors, (645), 471 states have internal predecessors, (645), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:39:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 729 transitions. [2024-11-20 08:39:03,015 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 729 transitions. Word has length 145 [2024-11-20 08:39:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:39:03,015 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 729 transitions. [2024-11-20 08:39:03,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 729 transitions. [2024-11-20 08:39:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:39:03,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:39:03,016 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:39:03,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-20 08:39:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:39:03,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:39:03,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:39:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1244546081, now seen corresponding path program 1 times [2024-11-20 08:39:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:39:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779561465] [2024-11-20 08:39:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:39:03,218 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-20 08:39:03,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:39:03,219 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:39:03,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 08:39:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:39:03,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:39:03,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:39:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-20 08:39:04,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:39:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:39:05,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:39:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779561465] [2024-11-20 08:39:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779561465] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:39:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:39:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-20 08:39:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768372526] [2024-11-20 08:39:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:39:05,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:39:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:39:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:39:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:39:05,311 INFO L87 Difference]: Start difference. First operand 523 states and 729 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:39:05,621 INFO L93 Difference]: Finished difference Result 897 states and 1258 transitions. [2024-11-20 08:39:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:39:05,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-20 08:39:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:39:05,623 INFO L225 Difference]: With dead ends: 897 [2024-11-20 08:39:05,623 INFO L226 Difference]: Without dead ends: 573 [2024-11-20 08:39:05,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:39:05,624 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 119 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:39:05,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 443 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:39:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-20 08:39:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 463. [2024-11-20 08:39:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 410 states have (on average 1.3560975609756099) internal successors, (556), 411 states have internal predecessors, (556), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:39:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 640 transitions. [2024-11-20 08:39:05,670 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 640 transitions. Word has length 145 [2024-11-20 08:39:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:39:05,670 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 640 transitions. [2024-11-20 08:39:05,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:39:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 640 transitions. [2024-11-20 08:39:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 08:39:05,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:39:05,671 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:39:05,678 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 (14)] Ended with exit code 0 [2024-11-20 08:39:05,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-20 08:39:05,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:39:05,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:39:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2144036769, now seen corresponding path program 1 times [2024-11-20 08:39:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:39:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843737080] [2024-11-20 08:39:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:39:05,873 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-20 08:39:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:39:05,875 INFO L229 MonitoredProcess]: Starting monitored process 15 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-20 08:39:05,876 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 (15)] Waiting until timeout for monitored process [2024-11-20 08:39:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:39:06,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:39:06,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:39:06,787 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-20 08:39:07,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-20 08:39:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:39:07,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:39:07,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:39:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843737080] [2024-11-20 08:39:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843737080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:39:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:39:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:39:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199929020] [2024-11-20 08:39:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:39:07,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:39:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:39:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:39:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:39:07,241 INFO L87 Difference]: Start difference. First operand 463 states and 640 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)