./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:44:19,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:44:19,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:44:19,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:44:19,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:44:19,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:44:19,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:44:19,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:44:19,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:44:19,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:44:19,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:44:19,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:44:19,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:44:19,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:44:19,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:44:19,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:44:19,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:44:19,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:44:19,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:44:19,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:44:19,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:44:19,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:44:19,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:44:19,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:44:19,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:44:19,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:44:19,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:44:19,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:44:19,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:44:19,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:44:19,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:44:19,331 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2024-11-09 01:44:19,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:44:19,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:44:19,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:44:19,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:44:19,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:44:19,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:44:20,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:44:20,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:44:20,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:44:20,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a695def49/dbc7bd0a8bf44e8f875d21f0441d63f6/FLAG630140999 [2024-11-09 01:44:20,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a695def49/dbc7bd0a8bf44e8f875d21f0441d63f6 [2024-11-09 01:44:20,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:44:20,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:44:20,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:44:20,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:44:20,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:44:20,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:44:20" (1/1) ... [2024-11-09 01:44:20,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aec2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:20, skipping insertion in model container [2024-11-09 01:44:20,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:44:20" (1/1) ... [2024-11-09 01:44:20,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:44:21,068 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-67.i[917,930] [2024-11-09 01:44:21,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:44:21,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:44:21,144 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-67.i[917,930] [2024-11-09 01:44:21,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:44:21,193 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:44:21,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21 WrapperNode [2024-11-09 01:44:21,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:44:21,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:44:21,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:44:21,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:44:21,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,241 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-09 01:44:21,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:44:21,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:44:21,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:44:21,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:44:21,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,280 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-11-09 01:44:21,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:44:21,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:44:21,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:44:21,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:44:21,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (1/1) ... [2024-11-09 01:44:21,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:44:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:44:21,343 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-09 01:44:21,346 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-09 01:44:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:44:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:44:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:44:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:44:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:44:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:44:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:44:21,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:44:21,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:44:21,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:44:21,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:44:21,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:44:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:44:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:44:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:44:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:44:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:44:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:44:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:44:21,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:44:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:44:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:44:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:44:21,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:44:21,519 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:44:21,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:44:21,858 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-09 01:44:21,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:44:21,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:44:21,871 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:44:21,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:44:21 BoogieIcfgContainer [2024-11-09 01:44:21,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:44:21,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:44:21,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:44:21,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:44:21,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:44:20" (1/3) ... [2024-11-09 01:44:21,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d55e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:44:21, skipping insertion in model container [2024-11-09 01:44:21,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:21" (2/3) ... [2024-11-09 01:44:21,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d55e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:44:21, skipping insertion in model container [2024-11-09 01:44:21,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:44:21" (3/3) ... [2024-11-09 01:44:21,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:44:21,893 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:44:21,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:44:21,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:44:21,954 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;@6e3773ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:44:21,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:44:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:21,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:21,967 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:21,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1396846781, now seen corresponding path program 1 times [2024-11-09 01:44:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419119225] [2024-11-09 01:44:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419119225] [2024-11-09 01:44:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419119225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:22,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:44:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516014206] [2024-11-09 01:44:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:44:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:44:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:44:22,317 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:44:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:22,337 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-09 01:44:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:44:22,338 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-09 01:44:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:22,343 INFO L225 Difference]: With dead ends: 179 [2024-11-09 01:44:22,343 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:44:22,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-09 01:44:22,348 INFO L432 NwaCegarLoop]: 126 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, 126 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-09 01:44:22,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:44:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:44:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-09 01:44:22,421 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-09 01:44:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:22,422 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-09 01:44:22,422 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:44:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-09 01:44:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:22,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:22,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:44:22,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2119067347, now seen corresponding path program 1 times [2024-11-09 01:44:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522302420] [2024-11-09 01:44:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522302420] [2024-11-09 01:44:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522302420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:44:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687387102] [2024-11-09 01:44:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:22,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:44:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:22,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:44:22,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:44:22,639 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:44:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:22,674 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2024-11-09 01:44:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:44:22,675 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-09 01:44:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:22,676 INFO L225 Difference]: With dead ends: 177 [2024-11-09 01:44:22,676 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:44:22,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-09 01:44:22,677 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:22,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:44:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:44:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-09 01:44:22,691 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-09 01:44:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:22,692 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-09 01:44:22,692 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:44:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-09 01:44:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:22,696 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:22,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:44:22,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1532791125, now seen corresponding path program 1 times [2024-11-09 01:44:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935226032] [2024-11-09 01:44:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935226032] [2024-11-09 01:44:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935226032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:44:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296741200] [2024-11-09 01:44:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:44:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:44:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:44:22,870 INFO L87 Difference]: Start difference. First operand 91 states and 128 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:22,905 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-09 01:44:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:44:22,906 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-09 01:44:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:22,907 INFO L225 Difference]: With dead ends: 182 [2024-11-09 01:44:22,907 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 01:44:22,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-09 01:44:22,908 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:22,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 01:44:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-09 01:44:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-09 01:44:22,921 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-09 01:44:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:22,922 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-09 01:44:22,922 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-09 01:44:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:22,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:22,924 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:22,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:44:22,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash -852732755, now seen corresponding path program 1 times [2024-11-09 01:44:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401005550] [2024-11-09 01:44:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401005550] [2024-11-09 01:44:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401005550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:23,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:23,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:44:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886019925] [2024-11-09 01:44:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:23,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:44:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:44:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:44:23,128 INFO L87 Difference]: Start difference. First operand 93 states and 130 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:23,153 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-09 01:44:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:44:23,154 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-09 01:44:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:23,155 INFO L225 Difference]: With dead ends: 186 [2024-11-09 01:44:23,155 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:44:23,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-09 01:44:23,156 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:23,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:44:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-09 01:44:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-09 01:44:23,162 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-09 01:44:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:23,163 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-09 01:44:23,163 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-09 01:44:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:23,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:23,164 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:23,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:44:23,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 922274607, now seen corresponding path program 1 times [2024-11-09 01:44:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802001980] [2024-11-09 01:44:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802001980] [2024-11-09 01:44:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802001980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:44:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139881158] [2024-11-09 01:44:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:44:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:44:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:44:23,284 INFO L87 Difference]: Start difference. First operand 95 states and 132 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:23,300 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2024-11-09 01:44:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:44:23,301 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-09 01:44:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:23,303 INFO L225 Difference]: With dead ends: 190 [2024-11-09 01:44:23,303 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:44:23,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-09 01:44:23,305 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:23,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:44:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-09 01:44:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2024-11-09 01:44:23,317 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 104 [2024-11-09 01:44:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:23,317 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2024-11-09 01:44:23,317 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-09 01:44:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:23,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:23,318 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:23,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:44:23,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:23,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 924121649, now seen corresponding path program 1 times [2024-11-09 01:44:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237058452] [2024-11-09 01:44:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 01:44:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237058452] [2024-11-09 01:44:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237058452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:44:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373040117] [2024-11-09 01:44:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:44:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:44:27,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:44:27,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:44:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:27,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 01:44:27,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:44:27,951 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-09 01:44:28,393 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 32 treesize of output 16 [2024-11-09 01:44:29,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 84 [2024-11-09 01:44:29,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:29,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:29,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 92 [2024-11-09 01:44:29,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:29,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:29,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 01:44:30,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:30,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:44:30,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:44:30,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 160 [2024-11-09 01:44:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 68 proven. 138 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 01:44:30,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:44:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373040117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:44:31,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:44:31,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2024-11-09 01:44:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194790141] [2024-11-09 01:44:31,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:44:31,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 01:44:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 01:44:31,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1975, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 01:44:31,371 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 38 states, 32 states have (on average 3.09375) internal successors, (99), 33 states have internal predecessors, (99), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-09 01:44:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:51,439 INFO L93 Difference]: Finished difference Result 471 states and 637 transitions. [2024-11-09 01:44:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 01:44:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 3.09375) internal successors, (99), 33 states have internal predecessors, (99), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) Word has length 104 [2024-11-09 01:44:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:51,442 INFO L225 Difference]: With dead ends: 471 [2024-11-09 01:44:51,443 INFO L226 Difference]: Without dead ends: 377 [2024-11-09 01:44:51,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1902, Invalid=7404, Unknown=6, NotChecked=0, Total=9312 [2024-11-09 01:44:51,450 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 1393 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 4642 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:51,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 4642 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:44:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-09 01:44:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 188. [2024-11-09 01:44:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.3170731707317074) internal successors, (216), 165 states have internal predecessors, (216), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:44:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 252 transitions. [2024-11-09 01:44:51,485 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 252 transitions. Word has length 104 [2024-11-09 01:44:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:51,485 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 252 transitions. [2024-11-09 01:44:51,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 3.09375) internal successors, (99), 33 states have internal predecessors, (99), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-09 01:44:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 252 transitions. [2024-11-09 01:44:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:44:51,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:51,487 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:51,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:44:51,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:44:51,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:51,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -881316685, now seen corresponding path program 1 times [2024-11-09 01:44:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251089808] [2024-11-09 01:44:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251089808] [2024-11-09 01:44:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251089808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:51,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:51,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:44:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399347232] [2024-11-09 01:44:51,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:44:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:44:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:44:51,765 INFO L87 Difference]: Start difference. First operand 188 states and 252 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:51,791 INFO L93 Difference]: Finished difference Result 411 states and 550 transitions. [2024-11-09 01:44:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:44:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-09 01:44:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:51,795 INFO L225 Difference]: With dead ends: 411 [2024-11-09 01:44:51,795 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 01:44:51,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 01:44:51,796 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:51,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:44:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 01:44:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2024-11-09 01:44:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.308641975308642) internal successors, (212), 163 states have internal predecessors, (212), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:44:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 248 transitions. [2024-11-09 01:44:51,811 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 248 transitions. Word has length 104 [2024-11-09 01:44:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:51,812 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 248 transitions. [2024-11-09 01:44:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 248 transitions. [2024-11-09 01:44:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:44:51,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:51,813 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:44:51,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 658834688, now seen corresponding path program 1 times [2024-11-09 01:44:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895763088] [2024-11-09 01:44:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895763088] [2024-11-09 01:44:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895763088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:44:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203706667] [2024-11-09 01:44:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:44:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:44:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:44:52,552 INFO L87 Difference]: Start difference. First operand 186 states and 248 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:44:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:52,910 INFO L93 Difference]: Finished difference Result 540 states and 719 transitions. [2024-11-09 01:44:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:44:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-09 01:44:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:52,913 INFO L225 Difference]: With dead ends: 540 [2024-11-09 01:44:52,913 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 01:44:52,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:44:52,914 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 437 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:52,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 760 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:44:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 01:44:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 215. [2024-11-09 01:44:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 191 states have (on average 1.3298429319371727) internal successors, (254), 192 states have internal predecessors, (254), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:44:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 290 transitions. [2024-11-09 01:44:52,936 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 290 transitions. Word has length 108 [2024-11-09 01:44:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:52,936 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 290 transitions. [2024-11-09 01:44:52,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:44:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 290 transitions. [2024-11-09 01:44:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:44:52,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:52,937 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:44:52,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1501200389, now seen corresponding path program 1 times [2024-11-09 01:44:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609233327] [2024-11-09 01:44:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609233327] [2024-11-09 01:44:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609233327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:44:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789095302] [2024-11-09 01:44:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:44:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:44:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:44:53,122 INFO L87 Difference]: Start difference. First operand 215 states and 290 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:53,363 INFO L93 Difference]: Finished difference Result 582 states and 790 transitions. [2024-11-09 01:44:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:44:53,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-09 01:44:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:53,366 INFO L225 Difference]: With dead ends: 582 [2024-11-09 01:44:53,366 INFO L226 Difference]: Without dead ends: 370 [2024-11-09 01:44:53,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:44:53,368 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 93 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:53,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 930 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:44:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-09 01:44:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 246. [2024-11-09 01:44:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 222 states have (on average 1.3558558558558558) internal successors, (301), 223 states have internal predecessors, (301), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:44:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 337 transitions. [2024-11-09 01:44:53,390 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 337 transitions. Word has length 110 [2024-11-09 01:44:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:53,390 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 337 transitions. [2024-11-09 01:44:53,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 337 transitions. [2024-11-09 01:44:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:44:53,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:53,391 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:44:53,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 952153733, now seen corresponding path program 1 times [2024-11-09 01:44:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139459114] [2024-11-09 01:44:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:53,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139459114] [2024-11-09 01:44:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139459114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:44:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939884446] [2024-11-09 01:44:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:53,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:44:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:44:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:44:53,541 INFO L87 Difference]: Start difference. First operand 246 states and 337 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:53,756 INFO L93 Difference]: Finished difference Result 569 states and 780 transitions. [2024-11-09 01:44:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:44:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-09 01:44:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:53,758 INFO L225 Difference]: With dead ends: 569 [2024-11-09 01:44:53,758 INFO L226 Difference]: Without dead ends: 326 [2024-11-09 01:44:53,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:44:53,759 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:53,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 877 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:44:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-09 01:44:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 272. [2024-11-09 01:44:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 248 states have (on average 1.3669354838709677) internal successors, (339), 249 states have internal predecessors, (339), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:44:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 375 transitions. [2024-11-09 01:44:53,783 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 375 transitions. Word has length 110 [2024-11-09 01:44:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:53,783 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 375 transitions. [2024-11-09 01:44:53,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 375 transitions. [2024-11-09 01:44:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:44:53,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:53,784 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:44:53,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1267966515, now seen corresponding path program 1 times [2024-11-09 01:44:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:53,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687707958] [2024-11-09 01:44:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687707958] [2024-11-09 01:44:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687707958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:44:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357457287] [2024-11-09 01:44:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:53,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:44:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:44:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:44:53,887 INFO L87 Difference]: Start difference. First operand 272 states and 375 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:54,009 INFO L93 Difference]: Finished difference Result 609 states and 833 transitions. [2024-11-09 01:44:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:44:54,009 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-09 01:44:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:54,011 INFO L225 Difference]: With dead ends: 609 [2024-11-09 01:44:54,011 INFO L226 Difference]: Without dead ends: 340 [2024-11-09 01:44:54,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-09 01:44:54,012 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 88 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:54,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 563 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:44:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-09 01:44:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 215. [2024-11-09 01:44:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 197 states have (on average 1.3705583756345177) internal successors, (270), 197 states have internal predecessors, (270), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2024-11-09 01:44:54,027 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 111 [2024-11-09 01:44:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-11-09 01:44:54,028 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2024-11-09 01:44:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:44:54,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:54,029 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:54,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:44:54,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:54,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 983159884, now seen corresponding path program 1 times [2024-11-09 01:44:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357172672] [2024-11-09 01:44:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:44:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:44:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:44:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:44:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:44:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:44:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:44:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:44:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:44:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:44:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:44:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:44:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:44:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:44:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:44:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357172672] [2024-11-09 01:44:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357172672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:44:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:44:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:44:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867569840] [2024-11-09 01:44:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:44:54,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:44:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:44:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:44:54,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:44:54,153 INFO L87 Difference]: Start difference. First operand 215 states and 294 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:44:54,268 INFO L93 Difference]: Finished difference Result 487 states and 663 transitions. [2024-11-09 01:44:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:44:54,268 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-09 01:44:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:44:54,269 INFO L225 Difference]: With dead ends: 487 [2024-11-09 01:44:54,270 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 01:44:54,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-09 01:44:54,271 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 85 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:44:54,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 542 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:44:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 01:44:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 214. [2024-11-09 01:44:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 196 states have internal predecessors, (267), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:44:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 291 transitions. [2024-11-09 01:44:54,294 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 291 transitions. Word has length 111 [2024-11-09 01:44:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:44:54,294 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 291 transitions. [2024-11-09 01:44:54,294 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:44:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 291 transitions. [2024-11-09 01:44:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:44:54,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:44:54,295 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:44:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:44:54,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:44:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:44:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1038331780, now seen corresponding path program 1 times [2024-11-09 01:44:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:44:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007844643] [2024-11-09 01:44:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:44:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:44:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164401895] [2024-11-09 01:44:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:44:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:44:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:44:54,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:44:54,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:44:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:44:54,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:44:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:44:54,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:44:54,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:44:54,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:44:54,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:44:55,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:44:55,049 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:44:55,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:44:55,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:44:55 BoogieIcfgContainer [2024-11-09 01:44:55,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:44:55,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:44:55,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:44:55,155 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:44:55,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:44:21" (3/4) ... [2024-11-09 01:44:55,157 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:44:55,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:44:55,158 INFO L158 Benchmark]: Toolchain (without parser) took 34260.33ms. Allocated memory was 159.4MB in the beginning and 587.2MB in the end (delta: 427.8MB). Free memory was 84.9MB in the beginning and 391.4MB in the end (delta: -306.5MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,158 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:44:55,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.06ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 84.7MB in the beginning and 197.5MB in the end (delta: -112.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.16ms. Allocated memory is still 228.6MB. Free memory was 197.5MB in the beginning and 193.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,159 INFO L158 Benchmark]: Boogie Preprocessor took 66.21ms. Allocated memory is still 228.6MB. Free memory was 193.3MB in the beginning and 189.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,159 INFO L158 Benchmark]: RCFGBuilder took 563.28ms. Allocated memory is still 228.6MB. Free memory was 189.1MB in the beginning and 153.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,159 INFO L158 Benchmark]: TraceAbstraction took 33279.87ms. Allocated memory was 228.6MB in the beginning and 587.2MB in the end (delta: 358.6MB). Free memory was 153.5MB in the beginning and 391.4MB in the end (delta: -238.0MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2024-11-09 01:44:55,159 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 587.2MB. Free memory is still 391.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:44:55,160 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.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.06ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 84.7MB in the beginning and 197.5MB in the end (delta: -112.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.16ms. Allocated memory is still 228.6MB. Free memory was 197.5MB in the beginning and 193.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.21ms. Allocated memory is still 228.6MB. Free memory was 193.3MB in the beginning and 189.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 563.28ms. Allocated memory is still 228.6MB. Free memory was 189.1MB in the beginning and 153.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33279.87ms. Allocated memory was 228.6MB in the beginning and 587.2MB in the end (delta: 358.6MB). Free memory was 153.5MB in the beginning and 391.4MB in the end (delta: -238.0MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 587.2MB. Free memory is still 391.4MB. 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 91, overapproximation of shiftRight at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[1] = { 25.875 }; [L26-L28] double double_Array_0[1] = { 25.875 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L33] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L34] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L39] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L44] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L45] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer = &(signed_short_int_Array_0[2]); [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L50] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L51] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[2]); [L52] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L53] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L54] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=0, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR signed_long_int_Array_0[1] [L107] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L108] EXPR signed_short_int_Array_0[2] [L108] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L109] EXPR unsigned_short_int_Array_0[2] [L109] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L87] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L90] float_Array_0[0] = __VERIFIER_nondet_float() [L91] EXPR float_Array_0[0] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L91] EXPR float_Array_0[0] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L96] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L99] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L102] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L103] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L120] RET updateVariables() [L121] CALL step() [L58] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L59] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L61] signed long int stepLocal_0 = 1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, stepLocal_0=515, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] COND TRUE ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > stepLocal_0 [L63] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L63] EXPR (((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0) [L63] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L63] EXPR (((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L63] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) = (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))) [L67] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L67] (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L68] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L68] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L70] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L70] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L70] signed long int stepLocal_2 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L71] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L71] unsigned short int stepLocal_1 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)); [L72] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L72] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L75] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L75] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > stepLocal_2) [L82] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L82] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L82] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112-L113] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2243 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2243 mSDsluCounter, 10192 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8328 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3237 IncrementalHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 1864 mSDtfsCounter, 3237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=10, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 738 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1369 ConstructedInterpolants, 1 QuantifiedInterpolants, 9568 SizeOfPredicates, 13 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3279/3432 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-09 01:44:55,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:44:56,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:44:56,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:44:56,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:44:56,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:44:56,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:44:56,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:44:56,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:44:56,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:44:56,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:44:56,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:44:56,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:44:56,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:44:57,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:44:57,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:44:57,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:44:57,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:44:57,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:44:57,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:44:57,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:44:57,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:44:57,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:44:57,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:44:57,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:44:57,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:44:57,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:44:57,006 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:44:57,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:44:57,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:44:57,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:44:57,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:44:57,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:44:57,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:44:57,008 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:44:57,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:44:57,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:44:57,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:44:57,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:44:57,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:44:57,009 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2024-11-09 01:44:57,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:44:57,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:44:57,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:44:57,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:44:57,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:44:57,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:44:58,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:44:58,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:44:58,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:44:58,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3371c63/c12a73a2556840f58cfe29afdc9ffc51/FLAG5d231ea3a [2024-11-09 01:44:59,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3371c63/c12a73a2556840f58cfe29afdc9ffc51 [2024-11-09 01:44:59,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:44:59,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:44:59,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:44:59,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:44:59,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:44:59,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480bf7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59, skipping insertion in model container [2024-11-09 01:44:59,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:44:59,262 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-67.i[917,930] [2024-11-09 01:44:59,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:44:59,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:44:59,352 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-67.i[917,930] [2024-11-09 01:44:59,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:44:59,401 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:44:59,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59 WrapperNode [2024-11-09 01:44:59,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:44:59,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:44:59,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:44:59,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:44:59,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,460 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-11-09 01:44:59,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:44:59,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:44:59,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:44:59,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:44:59,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,511 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-11-09 01:44:59,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:44:59,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:44:59,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:44:59,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:44:59,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (1/1) ... [2024-11-09 01:44:59,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:44:59,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:44:59,594 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-09 01:44:59,602 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-09 01:44:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:44:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:44:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:44:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:44:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:44:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:44:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:44:59,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:44:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:44:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:44:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:44:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:44:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:44:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:44:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:44:59,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:44:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:44:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:44:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:44:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:44:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:44:59,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:44:59,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:44:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:44:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:44:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:44:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:44:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:44:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:44:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:44:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:44:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:44:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:44:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:44:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:44:59,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:44:59,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:45:00,440 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 01:45:00,440 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:45:00,461 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:45:00,462 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:45:00,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:45:00 BoogieIcfgContainer [2024-11-09 01:45:00,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:45:00,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:45:00,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:45:00,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:45:00,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:44:59" (1/3) ... [2024-11-09 01:45:00,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab770cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:45:00, skipping insertion in model container [2024-11-09 01:45:00,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:44:59" (2/3) ... [2024-11-09 01:45:00,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab770cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:45:00, skipping insertion in model container [2024-11-09 01:45:00,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:45:00" (3/3) ... [2024-11-09 01:45:00,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2024-11-09 01:45:00,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:45:00,481 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:45:00,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:45:00,538 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;@7fd83604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:45:00,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:45:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:00,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:00,550 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:00,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash -5467384, now seen corresponding path program 1 times [2024-11-09 01:45:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:00,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901580308] [2024-11-09 01:45:00,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:00,564 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-09 01:45:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:00,565 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-09 01:45:00,587 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-09 01:45:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:00,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:45:00,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 01:45:00,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:45:00,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:45:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901580308] [2024-11-09 01:45:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901580308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:45:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:45:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:45:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872145444] [2024-11-09 01:45:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:45:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:45:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:45:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:45:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:45:00,946 INFO L87 Difference]: Start difference. First operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:45:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:45:00,974 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2024-11-09 01:45:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:45:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-09 01:45:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:45:00,982 INFO L225 Difference]: With dead ends: 169 [2024-11-09 01:45:00,982 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 01:45:00,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-09 01:45:00,989 INFO L432 NwaCegarLoop]: 119 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, 119 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-09 01:45:00,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:45:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 01:45:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 01:45:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-09 01:45:01,031 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2024-11-09 01:45:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:45:01,031 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-09 01:45:01,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:45:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-09 01:45:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:01,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:01,035 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:01,043 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-09 01:45:01,235 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-09 01:45:01,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 712400024, now seen corresponding path program 1 times [2024-11-09 01:45:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647070573] [2024-11-09 01:45:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:01,238 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-09 01:45:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:01,242 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-09 01:45:01,243 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-09 01:45:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:01,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:45:01,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:45:01,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:45:01,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:45:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647070573] [2024-11-09 01:45:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647070573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:45:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:45:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:45:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519098744] [2024-11-09 01:45:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:45:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:45:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:45:01,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:45:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:45:01,562 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:45:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:45:01,610 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2024-11-09 01:45:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:45:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-09 01:45:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:45:01,614 INFO L225 Difference]: With dead ends: 167 [2024-11-09 01:45:01,614 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:45:01,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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-09 01:45:01,615 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:45:01,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:45:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:45:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 01:45:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-11-09 01:45:01,624 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 103 [2024-11-09 01:45:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:45:01,626 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-11-09 01:45:01,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:45:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-11-09 01:45:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:01,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:01,628 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:01,636 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-09 01:45:01,828 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-09 01:45:01,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:01,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1623992486, now seen corresponding path program 1 times [2024-11-09 01:45:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548869547] [2024-11-09 01:45:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:01,830 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-09 01:45:01,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:01,833 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-09 01:45:01,834 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-09 01:45:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:02,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:45:02,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:45:02,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:45:02,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:45:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548869547] [2024-11-09 01:45:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548869547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:45:02,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:45:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:45:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365918857] [2024-11-09 01:45:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:45:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:45:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:45:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:45:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:45:02,128 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:45:02,191 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2024-11-09 01:45:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:45:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:45:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:45:02,192 INFO L225 Difference]: With dead ends: 174 [2024-11-09 01:45:02,193 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:45:02,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:45:02,194 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:45:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:45:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:45:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-09 01:45:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-09 01:45:02,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2024-11-09 01:45:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:45:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-09 01:45:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-09 01:45:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:02,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:02,206 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:02,218 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-09 01:45:02,408 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-09 01:45:02,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -943934116, now seen corresponding path program 1 times [2024-11-09 01:45:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027377737] [2024-11-09 01:45:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:02,410 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-09 01:45:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:02,411 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-09 01:45:02,412 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-09 01:45:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:02,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:45:02,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:45:02,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:45:02,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:45:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027377737] [2024-11-09 01:45:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027377737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:45:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:45:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:45:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406512159] [2024-11-09 01:45:02,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:45:02,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:45:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:45:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:45:02,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:45:02,695 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:45:02,774 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-11-09 01:45:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:45:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:45:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:45:02,780 INFO L225 Difference]: With dead ends: 180 [2024-11-09 01:45:02,780 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:45:02,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:45:02,781 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:45:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:45:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:45:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-09 01:45:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-09 01:45:02,805 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2024-11-09 01:45:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:45:02,806 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-09 01:45:02,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-09 01:45:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:02,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:02,807 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:02,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 01:45:03,015 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-09 01:45:03,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:03,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 831073246, now seen corresponding path program 1 times [2024-11-09 01:45:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:03,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096294738] [2024-11-09 01:45:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:03,017 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-09 01:45:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:03,019 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-09 01:45:03,020 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-09 01:45:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:03,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:45:03,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:45:03,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:45:03,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:45:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096294738] [2024-11-09 01:45:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096294738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:45:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:45:03,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:45:03,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399824092] [2024-11-09 01:45:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:45:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:45:03,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:45:03,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:45:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:45:03,297 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:45:03,410 INFO L93 Difference]: Finished difference Result 184 states and 255 transitions. [2024-11-09 01:45:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:45:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:45:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:45:03,411 INFO L225 Difference]: With dead ends: 184 [2024-11-09 01:45:03,411 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 01:45:03,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:45:03,413 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:45:03,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:45:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 01:45:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-09 01:45:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:45:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-09 01:45:03,418 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103 [2024-11-09 01:45:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:45:03,418 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-09 01:45:03,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:45:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-09 01:45:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:45:03,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:45:03,421 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:45:03,431 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-09 01:45:03,621 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-09 01:45:03,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:45:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:45:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 832920288, now seen corresponding path program 1 times [2024-11-09 01:45:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:45:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402386539] [2024-11-09 01:45:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:45:03,623 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-09 01:45:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:45:03,624 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-09 01:45:03,624 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-09 01:45:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:45:03,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 01:45:03,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:45:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:45:05,466 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 31 treesize of output 26 [2024-11-09 01:45:06,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-11-09 01:45:07,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:45:07,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 75 [2024-11-09 01:45:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 114 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 01:45:07,576 INFO L311 TraceCheckSpWp]: Computing backward predicates...