./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:25:38,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:25:38,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:25:38,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:25:38,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:25:38,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:25:38,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:25:38,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:25:38,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:25:38,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:25:38,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:25:38,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:25:38,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:25:38,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:25:38,238 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:25:38,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:25:38,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:25:38,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:25:38,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:25:38,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:25:38,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:25:38,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:25:38,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:25:38,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:25:38,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:25:38,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:25:38,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:25:38,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:25:38,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:25:38,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:25:38,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:25:38,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:25:38,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:25:38,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:25:38,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:25:38,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:25:38,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:25:38,250 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-clean/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-clean/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 -> f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 [2024-10-11 13:25:38,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:25:38,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:25:38,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:25:38,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:25:38,494 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:25:38,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:39,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:25:39,938 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:25:39,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:39,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf53cc21b/ea70589d3e38404abbb674f19035bd2a/FLAGcdba5fe9b [2024-10-11 13:25:39,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf53cc21b/ea70589d3e38404abbb674f19035bd2a [2024-10-11 13:25:39,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:25:39,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:25:39,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:25:39,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:25:39,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:25:39,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:25:39" (1/1) ... [2024-10-11 13:25:39,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f51262e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:39, skipping insertion in model container [2024-10-11 13:25:39,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:25:39" (1/1) ... [2024-10-11 13:25:39,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:25:40,116 WARN L248 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-26.i[917,930] [2024-10-11 13:25:40,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:25:40,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:25:40,202 WARN L248 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-26.i[917,930] [2024-10-11 13:25:40,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:25:40,255 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:25:40,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40 WrapperNode [2024-10-11 13:25:40,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:25:40,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:25:40,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:25:40,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:25:40,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,319 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-10-11 13:25:40,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:25:40,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:25:40,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:25:40,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:25:40,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,357 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-10-11 13:25:40,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:25:40,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:25:40,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:25:40,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:25:40,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (1/1) ... [2024-10-11 13:25:40,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:25:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:25:40,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:25:40,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:25:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:25:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:25:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:25:40,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:25:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:25:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:25:40,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:25:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:25:40,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:25:40,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:25:40,582 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:25:40,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:25:40,957 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-11 13:25:40,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:25:40,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:25:40,985 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:25:40,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:25:40 BoogieIcfgContainer [2024-10-11 13:25:40,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:25:40,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:25:40,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:25:40,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:25:40,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:25:39" (1/3) ... [2024-10-11 13:25:40,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c37703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:25:40, skipping insertion in model container [2024-10-11 13:25:40,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:40" (2/3) ... [2024-10-11 13:25:40,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c37703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:25:40, skipping insertion in model container [2024-10-11 13:25:40,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:25:40" (3/3) ... [2024-10-11 13:25:40,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:41,006 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:25:41,006 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:25:41,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:25:41,055 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;@594994c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:25:41,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:25:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:41,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:41,066 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:41,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:41,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:41,071 INFO L85 PathProgramCache]: Analyzing trace with hash 821484576, now seen corresponding path program 1 times [2024-10-11 13:25:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:25:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820501122] [2024-10-11 13:25:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:25:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:25:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:25:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:25:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:25:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:25:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:25:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:25:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:25:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:25:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:25:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820501122] [2024-10-11 13:25:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820501122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:25:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254629218] [2024-10-11 13:25:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:41,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:25:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:25:41,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:25:41,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:25:41,397 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:25:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:41,435 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-11 13:25:41,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:25:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-11 13:25:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:41,443 INFO L225 Difference]: With dead ends: 169 [2024-10-11 13:25:41,443 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 13:25:41,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-10-11 13:25:41,447 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:41,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:25:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 13:25:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 13:25:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-11 13:25:41,492 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-11 13:25:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:41,492 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-11 13:25:41,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:25:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-11 13:25:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:41,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:41,498 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:25:41,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -700590830, now seen corresponding path program 1 times [2024-10-11 13:25:41,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:25:41,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972910682] [2024-10-11 13:25:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:25:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:25:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:25:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:25:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:25:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:25:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:25:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:25:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:25:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:25:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:25:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972910682] [2024-10-11 13:25:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972910682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:41,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:25:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951271186] [2024-10-11 13:25:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:41,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:25:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:25:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:25:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:25:41,823 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:41,872 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2024-10-11 13:25:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:25:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-11 13:25:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:41,874 INFO L225 Difference]: With dead ends: 170 [2024-10-11 13:25:41,875 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:25:41,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-10-11 13:25:41,877 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:41,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:25:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:25:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 13:25:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-11 13:25:41,892 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 84 [2024-10-11 13:25:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:41,893 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-11 13:25:41,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-11 13:25:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:41,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:41,896 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:25:41,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -700531248, now seen corresponding path program 1 times [2024-10-11 13:25:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:25:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944727878] [2024-10-11 13:25:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:25:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:25:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:25:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:25:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:25:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:25:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:25:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:25:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:25:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:25:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:25:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944727878] [2024-10-11 13:25:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944727878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:42,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722104594] [2024-10-11 13:25:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:42,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:42,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:25:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:42,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:42,220 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:42,322 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-10-11 13:25:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-11 13:25:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:42,327 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:25:42,327 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:25:42,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-10-11 13:25:42,329 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:42,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:25:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:25:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 13:25:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-10-11 13:25:42,372 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 84 [2024-10-11 13:25:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:42,373 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-10-11 13:25:42,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-10-11 13:25:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:42,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:42,374 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:42,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:25:42,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:42,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1905492306, now seen corresponding path program 1 times [2024-10-11 13:25:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:25:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328753547] [2024-10-11 13:25:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:25:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:25:42,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339485909] [2024-10-11 13:25:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:42,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:25:42,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:25:42,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:25:42,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:25:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:25:42,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:25:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:25:42,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:25:42,770 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:25:42,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:25:42,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:25:42,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:25:42,976 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:25:43,056 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:25:43,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:25:43 BoogieIcfgContainer [2024-10-11 13:25:43,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:25:43,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:25:43,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:25:43,059 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:25:43,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:25:40" (3/4) ... [2024-10-11 13:25:43,061 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:25:43,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:25:43,062 INFO L158 Benchmark]: Toolchain (without parser) took 3100.63ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 102.1MB in the beginning and 112.6MB in the end (delta: -10.5MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,062 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:25:43,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.86ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 85.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.96ms. Allocated memory is still 172.0MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,063 INFO L158 Benchmark]: Boogie Preprocessor took 69.03ms. Allocated memory is still 172.0MB. Free memory was 81.2MB in the beginning and 76.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,063 INFO L158 Benchmark]: RCFGBuilder took 593.80ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 76.1MB in the beginning and 160.0MB in the end (delta: -83.9MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,064 INFO L158 Benchmark]: TraceAbstraction took 2070.12ms. Allocated memory is still 222.3MB. Free memory was 160.0MB in the beginning and 113.7MB in the end (delta: 46.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,064 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 222.3MB. Free memory was 113.7MB in the beginning and 112.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:25:43,065 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.13ms. Allocated memory is still 172.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.86ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 85.6MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.96ms. Allocated memory is still 172.0MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.03ms. Allocated memory is still 172.0MB. Free memory was 81.2MB in the beginning and 76.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 593.80ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 76.1MB in the beginning and 160.0MB in the end (delta: -83.9MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2070.12ms. Allocated memory is still 222.3MB. Free memory was 160.0MB in the beginning and 113.7MB in the end (delta: 46.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 222.3MB. Free memory was 113.7MB in the beginning and 112.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0][0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1][0]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[0][1]); [L28] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[1][1]); [L29-L31] signed long int signed_long_int_Array_0[1] = { -32 }; [L29-L31] signed long int signed_long_int_Array_0[1] = { -32 }; [L32] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L36] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L41] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L46] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L47] unsigned char last_1_unsigned_char_Array_0_1_ = 64; [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L83] EXPR unsigned_char_Array_0[1] [L83] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] float_Array_0[0][1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][1] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L68] EXPR float_Array_0[0][1] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] float_Array_0[1][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][1] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F [L70] EXPR float_Array_0[1][1] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L71] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L72] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L78] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] RET updateVariables() [L95] CALL step() [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L51] (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) = ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) [L52] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L52] COND TRUE (- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L55] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L55] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L56] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L57] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L61] signed long int stepLocal_0 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))); [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L62] COND FALSE !(stepLocal_0 != ((*(unsigned_char_Array_0_arrayunsigned_char_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))))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) [L86] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L86] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_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_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_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_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_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_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_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_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86-L87] return ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_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_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 649 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 350 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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-10-11 13:25:43,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:25:45,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:25:45,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:25:45,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:25:45,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:25:45,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:25:45,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:25:45,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:25:45,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:25:45,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:25:45,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:25:45,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:25:45,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:25:45,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:25:45,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:25:45,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:25:45,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:25:45,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:25:45,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:25:45,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:25:45,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:25:45,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:25:45,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:25:45,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:25:45,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:25:45,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:25:45,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:25:45,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:25:45,171 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:25:45,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:25:45,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:25:45,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:25:45,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:25:45,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:25:45,173 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:25:45,173 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-clean/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-clean/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 -> f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 [2024-10-11 13:25:45,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:25:45,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:25:45,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:25:45,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:25:45,466 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:25:45,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:46,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:25:46,979 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:25:46,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:46,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0d100070/8a40c77d37474abc833696a6a5b5440f/FLAG64bd192cd [2024-10-11 13:25:47,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f0d100070/8a40c77d37474abc833696a6a5b5440f [2024-10-11 13:25:47,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:25:47,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:25:47,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:25:47,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:25:47,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:25:47,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549ee9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47, skipping insertion in model container [2024-10-11 13:25:47,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:25:47,152 WARN L248 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-26.i[917,930] [2024-10-11 13:25:47,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:25:47,239 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:25:47,276 WARN L248 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-26.i[917,930] [2024-10-11 13:25:47,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:25:47,337 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:25:47,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47 WrapperNode [2024-10-11 13:25:47,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:25:47,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:25:47,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:25:47,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:25:47,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,399 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-11 13:25:47,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:25:47,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:25:47,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:25:47,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:25:47,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,446 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-10-11 13:25:47,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:25:47,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:25:47,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:25:47,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:25:47,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (1/1) ... [2024-10-11 13:25:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:25:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:25:47,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:25:47,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:25:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:25:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:25:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:25:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:25:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:25:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:25:47,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:25:47,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:25:47,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:25:47,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:25:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:25:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:25:47,807 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:25:47,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:25:48,671 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-11 13:25:48,672 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:25:48,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:25:48,703 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:25:48,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:25:48 BoogieIcfgContainer [2024-10-11 13:25:48,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:25:48,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:25:48,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:25:48,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:25:48,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:25:47" (1/3) ... [2024-10-11 13:25:48,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3237ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:25:48, skipping insertion in model container [2024-10-11 13:25:48,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:25:47" (2/3) ... [2024-10-11 13:25:48,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3237ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:25:48, skipping insertion in model container [2024-10-11 13:25:48,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:25:48" (3/3) ... [2024-10-11 13:25:48,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-26.i [2024-10-11 13:25:48,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:25:48,724 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:25:48,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:25:48,776 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;@46a048f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:25:48,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:25:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:48,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:48,796 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:48,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 821484576, now seen corresponding path program 1 times [2024-10-11 13:25:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731057919] [2024-10-11 13:25:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:48,817 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-10-11 13:25:48,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:48,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:25:48,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:49,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:25:49,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 13:25:49,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:49,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731057919] [2024-10-11 13:25:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731057919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:25:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180870635] [2024-10-11 13:25:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:49,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:25:49,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:25:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:25:49,309 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:25:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:49,514 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-11 13:25:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:25:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-11 13:25:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:49,524 INFO L225 Difference]: With dead ends: 169 [2024-10-11 13:25:49,525 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 13:25:49,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-10-11 13:25:49,530 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:49,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:25:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 13:25:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 13:25:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-11 13:25:49,563 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-11 13:25:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:49,563 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-11 13:25:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 13:25:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-11 13:25:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:49,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:49,566 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:49,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:25:49,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -700590830, now seen corresponding path program 1 times [2024-10-11 13:25:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317364281] [2024-10-11 13:25:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:49,773 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-10-11 13:25:49,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:49,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:25:49,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:50,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:25:50,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:50,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:50,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317364281] [2024-10-11 13:25:50,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317364281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:50,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:50,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:25:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8761827] [2024-10-11 13:25:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:50,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:25:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:50,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:25:50,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:25:50,130 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:50,377 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2024-10-11 13:25:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:25:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-11 13:25:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:50,379 INFO L225 Difference]: With dead ends: 172 [2024-10-11 13:25:50,379 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 13:25:50,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-10-11 13:25:50,380 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:50,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:25:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 13:25:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-11 13:25:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-11 13:25:50,387 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 84 [2024-10-11 13:25:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-11 13:25:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-11 13:25:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:25:50,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:50,390 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:50,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:25:50,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash -700531248, now seen corresponding path program 1 times [2024-10-11 13:25:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186578972] [2024-10-11 13:25:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:50,593 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-10-11 13:25:50,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:50,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:25:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:50,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:25:50,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 13:25:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:51,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:51,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186578972] [2024-10-11 13:25:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186578972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:25:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622669226] [2024-10-11 13:25:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:25:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:25:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:25:51,008 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:51,582 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2024-10-11 13:25:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:25:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-11 13:25:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:51,584 INFO L225 Difference]: With dead ends: 176 [2024-10-11 13:25:51,584 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 13:25:51,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:25:51,585 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 120 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:51,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 406 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:25:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 13:25:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-11 13:25:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-11 13:25:51,595 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 84 [2024-10-11 13:25:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-11 13:25:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-11 13:25:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 13:25:51,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:51,597 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:51,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:51,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 13:25:51,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:51,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 274984842, now seen corresponding path program 1 times [2024-10-11 13:25:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976083502] [2024-10-11 13:25:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:51,803 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-10-11 13:25:51,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:51,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:25:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:52,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:25:52,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:52,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:25:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:52,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:52,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:52,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976083502] [2024-10-11 13:25:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976083502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:52,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:52,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360714561] [2024-10-11 13:25:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:52,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:52,173 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:52,398 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2024-10-11 13:25:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-11 13:25:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:52,399 INFO L225 Difference]: With dead ends: 175 [2024-10-11 13:25:52,399 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 13:25:52,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-10-11 13:25:52,400 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:52,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:25:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 13:25:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 13:25:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-10-11 13:25:52,405 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 86 [2024-10-11 13:25:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-10-11 13:25:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-10-11 13:25:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 13:25:52,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:52,407 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:52,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:25:52,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1413958900, now seen corresponding path program 1 times [2024-10-11 13:25:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95211200] [2024-10-11 13:25:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:52,609 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-10-11 13:25:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:52,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:25:52,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:52,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:25:52,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:25:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:52,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:52,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95211200] [2024-10-11 13:25:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95211200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128535121] [2024-10-11 13:25:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:52,938 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:53,203 INFO L93 Difference]: Finished difference Result 173 states and 245 transitions. [2024-10-11 13:25:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-11 13:25:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:53,204 INFO L225 Difference]: With dead ends: 173 [2024-10-11 13:25:53,205 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:25:53,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-10-11 13:25:53,206 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:53,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:25:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:25:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 13:25:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-10-11 13:25:53,210 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 86 [2024-10-11 13:25:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:53,211 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-10-11 13:25:53,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-10-11 13:25:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:25:53,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:53,212 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:53,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:25:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:25:53,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash 451953429, now seen corresponding path program 1 times [2024-10-11 13:25:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563521496] [2024-10-11 13:25:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:53,415 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-10-11 13:25:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:53,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:25:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:25:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:53,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:25:53,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:53,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:53,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563521496] [2024-10-11 13:25:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563521496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232528963] [2024-10-11 13:25:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:53,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:53,725 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:54,063 INFO L93 Difference]: Finished difference Result 171 states and 241 transitions. [2024-10-11 13:25:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:25:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:54,064 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:25:54,064 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:25:54,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-10-11 13:25:54,066 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:54,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:25:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:25:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 13:25:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-10-11 13:25:54,071 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 91 [2024-10-11 13:25:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-10-11 13:25:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-10-11 13:25:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:25:54,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:54,072 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:54,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:25:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 13:25:54,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash 317939923, now seen corresponding path program 1 times [2024-10-11 13:25:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958698541] [2024-10-11 13:25:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:54,276 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-10-11 13:25:54,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:54,278 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 13:25:54,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:25:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:54,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:25:54,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:54,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:54,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958698541] [2024-10-11 13:25:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958698541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252977680] [2024-10-11 13:25:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:54,575 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:54,891 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2024-10-11 13:25:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:25:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:54,893 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:25:54,893 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:25:54,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-10-11 13:25:54,894 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:54,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:25:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:25:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 13:25:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-10-11 13:25:54,898 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 91 [2024-10-11 13:25:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-10-11 13:25:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-10-11 13:25:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:25:54,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:54,900 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:54,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 13:25:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 13:25:55,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:55,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 536794641, now seen corresponding path program 1 times [2024-10-11 13:25:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018681859] [2024-10-11 13:25:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:55,104 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-10-11 13:25:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:55,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:25:55,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 13:25:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:55,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:25:55,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:55,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:55,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:55,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018681859] [2024-10-11 13:25:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018681859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:55,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:25:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293174790] [2024-10-11 13:25:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:55,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:25:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:25:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:25:55,408 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:55,736 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2024-10-11 13:25:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:25:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:25:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:55,742 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:25:55,742 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:25:55,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-10-11 13:25:55,743 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:55,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:25:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:25:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 13:25:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:25:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-11 13:25:55,753 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 91 [2024-10-11 13:25:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:55,753 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-11 13:25:55,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-11 13:25:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:25:55,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:55,754 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:55,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:25:55,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:25:55,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:55,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -280853809, now seen corresponding path program 1 times [2024-10-11 13:25:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:55,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799055290] [2024-10-11 13:25:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:55,957 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-10-11 13:25:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:55,958 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:25:55,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:25:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:56,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:25:56,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:25:56,449 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 28 treesize of output 24 [2024-10-11 13:25:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-11 13:25:56,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2024-10-11 13:25:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:25:56,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:25:56,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:25:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799055290] [2024-10-11 13:25:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799055290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:25:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:25:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:25:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259144698] [2024-10-11 13:25:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:25:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:25:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:25:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:25:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:25:56,689 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:25:58,858 INFO L93 Difference]: Finished difference Result 241 states and 331 transitions. [2024-10-11 13:25:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:25:58,859 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:25:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:25:58,860 INFO L225 Difference]: With dead ends: 241 [2024-10-11 13:25:58,860 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 13:25:58,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:25:58,861 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 88 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:25:58,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1020 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 13:25:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 13:25:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2024-10-11 13:25:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 135 states have internal predecessors, (181), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:25:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 209 transitions. [2024-10-11 13:25:58,869 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 209 transitions. Word has length 91 [2024-10-11 13:25:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:25:58,869 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 209 transitions. [2024-10-11 13:25:58,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:25:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 209 transitions. [2024-10-11 13:25:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:25:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:25:58,871 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:25:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:25:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:25:59,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:25:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:25:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -673880819, now seen corresponding path program 1 times [2024-10-11 13:25:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:25:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877306361] [2024-10-11 13:25:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:25:59,073 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-10-11 13:25:59,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:25:59,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:25:59,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:25:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:25:59,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:25:59,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:00,147 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 28 treesize of output 24 [2024-10-11 13:26:00,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 13:26:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 13:26:00,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:26:13,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877306361] [2024-10-11 13:26:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877306361] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:26:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2024-10-11 13:26:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031681819] [2024-10-11 13:26:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:26:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:13,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:26:13,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:26:13,965 INFO L87 Difference]: Start difference. First operand 151 states and 209 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:07,181 INFO L93 Difference]: Finished difference Result 389 states and 532 transitions. [2024-10-11 13:27:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:27:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:27:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:07,185 INFO L225 Difference]: With dead ends: 389 [2024-10-11 13:27:07,185 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 13:27:07,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 13:27:07,187 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 296 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:07,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1220 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 41.9s Time] [2024-10-11 13:27:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 13:27:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2024-10-11 13:27:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 205 states have internal predecessors, (272), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:27:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2024-10-11 13:27:07,202 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 91 [2024-10-11 13:27:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:07,205 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2024-10-11 13:27:07,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2024-10-11 13:27:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:27:07,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:07,206 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:27:07,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:07,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 13:27:07,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:07,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash -250777414, now seen corresponding path program 1 times [2024-10-11 13:27:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873038860] [2024-10-11 13:27:07,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:07,408 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-10-11 13:27:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:07,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 13:27:07,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:27:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:07,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:27:07,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:27:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:27:07,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:07,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873038860] [2024-10-11 13:27:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873038860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:07,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:07,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:27:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589399412] [2024-10-11 13:27:07,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:07,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:27:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:07,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:27:07,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:27:07,748 INFO L87 Difference]: Start difference. First operand 229 states and 314 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:08,012 INFO L93 Difference]: Finished difference Result 439 states and 603 transitions. [2024-10-11 13:27:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:27:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:27:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:08,014 INFO L225 Difference]: With dead ends: 439 [2024-10-11 13:27:08,014 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 13:27:08,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-10-11 13:27:08,019 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:08,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:27:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 13:27:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 13:27:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3415841584158417) internal successors, (271), 205 states have internal predecessors, (271), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:27:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 313 transitions. [2024-10-11 13:27:08,042 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 313 transitions. Word has length 91 [2024-10-11 13:27:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:08,042 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 313 transitions. [2024-10-11 13:27:08,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 313 transitions. [2024-10-11 13:27:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:27:08,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:08,043 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:27:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:27:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 13:27:08,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1068425864, now seen corresponding path program 1 times [2024-10-11 13:27:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171887626] [2024-10-11 13:27:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:27:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:08,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 13:27:08,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:27:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:08,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:27:08,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:08,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:27:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:27:08,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:08,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171887626] [2024-10-11 13:27:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171887626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:08,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:27:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437414353] [2024-10-11 13:27:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:08,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:27:08,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:27:08,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:27:08,713 INFO L87 Difference]: Start difference. First operand 229 states and 313 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:08,908 INFO L93 Difference]: Finished difference Result 433 states and 593 transitions. [2024-10-11 13:27:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:27:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-11 13:27:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:08,910 INFO L225 Difference]: With dead ends: 433 [2024-10-11 13:27:08,911 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 13:27:08,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-10-11 13:27:08,911 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:08,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:27:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 13:27:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-11 13:27:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 196 states have (on average 1.3316326530612246) internal successors, (261), 199 states have internal predecessors, (261), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:27:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 303 transitions. [2024-10-11 13:27:08,922 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 303 transitions. Word has length 91 [2024-10-11 13:27:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:08,922 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 303 transitions. [2024-10-11 13:27:08,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 303 transitions. [2024-10-11 13:27:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 13:27:08,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:08,923 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:27:08,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 13:27:09,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2027587340, now seen corresponding path program 1 times [2024-10-11 13:27:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194973256] [2024-10-11 13:27:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:27:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:09,129 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 13:27:09,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:27:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:09,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:27:09,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:09,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:27:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:27:09,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:09,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194973256] [2024-10-11 13:27:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194973256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:27:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992687485] [2024-10-11 13:27:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:27:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:27:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:27:09,492 INFO L87 Difference]: Start difference. First operand 223 states and 303 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:09,837 INFO L93 Difference]: Finished difference Result 427 states and 581 transitions. [2024-10-11 13:27:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:27:09,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-11 13:27:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:09,841 INFO L225 Difference]: With dead ends: 427 [2024-10-11 13:27:09,841 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 13:27:09,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-10-11 13:27:09,842 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:09,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:27:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 13:27:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-11 13:27:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 196 states have (on average 1.316326530612245) internal successors, (258), 199 states have internal predecessors, (258), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:27:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 300 transitions. [2024-10-11 13:27:09,851 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 300 transitions. Word has length 96 [2024-10-11 13:27:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 300 transitions. [2024-10-11 13:27:09,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 300 transitions. [2024-10-11 13:27:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 13:27:09,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:09,853 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:27:09,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 13:27:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 13:27:10,053 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 273235250, now seen corresponding path program 1 times [2024-10-11 13:27:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491269463] [2024-10-11 13:27:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:10,054 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-10-11 13:27:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:10,056 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 13:27:10,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:27:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:10,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:27:10,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:10,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:27:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:27:10,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:10,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491269463] [2024-10-11 13:27:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491269463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:27:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875595436] [2024-10-11 13:27:10,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:27:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:27:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:27:10,404 INFO L87 Difference]: Start difference. First operand 223 states and 300 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:10,706 INFO L93 Difference]: Finished difference Result 427 states and 575 transitions. [2024-10-11 13:27:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:27:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-11 13:27:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:10,707 INFO L225 Difference]: With dead ends: 427 [2024-10-11 13:27:10,707 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 13:27:10,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-10-11 13:27:10,708 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:10,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:27:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 13:27:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-11 13:27:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 199 states have internal predecessors, (255), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:27:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2024-10-11 13:27:10,739 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 96 [2024-10-11 13:27:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:10,739 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2024-10-11 13:27:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-11 13:27:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2024-10-11 13:27:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 13:27:10,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:10,740 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:27:10,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 13:27:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-11 13:27:10,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -737882000, now seen corresponding path program 1 times [2024-10-11 13:27:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216235626] [2024-10-11 13:27:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:10,942 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-10-11 13:27:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:10,945 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-11 13:27:10,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Waiting until timeout for monitored process [2024-10-11 13:27:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:11,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:27:11,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:12,759 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 28 treesize of output 24 [2024-10-11 13:27:12,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 13:27:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 13:27:13,229 INFO L311 TraceCheckSpWp]: Computing backward predicates...