./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:14:29,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:14:29,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:14:29,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:14:29,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:14:29,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:14:29,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:14:29,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:14:29,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:14:29,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:14:29,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:14:29,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:14:29,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:14:29,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:14:29,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:14:29,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:14:29,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:14:29,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:14:29,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:14:29,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:14:29,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:14:29,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:14:29,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:14:29,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:14:29,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:14:29,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:14:29,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:14:29,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:14:29,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:14:29,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:14:29,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:14:29,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:14:29,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:14:29,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:14:29,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:14:29,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:14:29,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:14:29,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:14:29,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:14:29,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:14:29,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:14:29,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:14:29,927 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2024-11-10 09:14:30,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:14:30,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:14:30,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:14:30,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:14:30,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:14:30,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:31,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:14:31,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:14:31,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:31,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8d7c04e/6710970bc8af4d0999665b3b2b520e44/FLAG6b7bfc785 [2024-11-10 09:14:31,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8d7c04e/6710970bc8af4d0999665b3b2b520e44 [2024-11-10 09:14:31,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:14:31,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:14:31,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:14:31,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:14:31,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:14:31,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:14:31" (1/1) ... [2024-11-10 09:14:31,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd09bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:31, skipping insertion in model container [2024-11-10 09:14:31,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:14:31" (1/1) ... [2024-11-10 09:14:31,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:14:32,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-10 09:14:32,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:14:32,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:14:32,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-10 09:14:32,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:14:32,421 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:14:32,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32 WrapperNode [2024-11-10 09:14:32,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:14:32,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:14:32,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:14:32,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:14:32,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,492 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-10 09:14:32,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:14:32,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:14:32,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:14:32,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:14:32,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,541 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2024-11-10 09:14:32,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:14:32,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:14:32,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:14:32,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:14:32,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (1/1) ... [2024-11-10 09:14:32,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:14:32,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:14:32,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:14:32,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:14:32,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:14:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:14:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:14:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:14:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:14:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:14:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:14:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:14:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:14:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:14:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:14:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:14:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:14:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:14:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:14:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:14:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:14:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:14:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:14:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:14:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:14:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:14:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:14:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:14:32,822 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:14:32,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:14:33,168 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~ite85#1;havoc property_#t~mem75#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short86#1;havoc property_#t~mem87#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short102#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short114#1; [2024-11-10 09:14:33,201 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-10 09:14:33,201 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:14:33,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:14:33,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:14:33,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:14:33 BoogieIcfgContainer [2024-11-10 09:14:33,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:14:33,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:14:33,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:14:33,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:14:33,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:14:31" (1/3) ... [2024-11-10 09:14:33,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e58eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:14:33, skipping insertion in model container [2024-11-10 09:14:33,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:32" (2/3) ... [2024-11-10 09:14:33,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e58eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:14:33, skipping insertion in model container [2024-11-10 09:14:33,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:14:33" (3/3) ... [2024-11-10 09:14:33,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:33,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:14:33,232 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:14:33,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:14:33,281 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;@415b096f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:14:33,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:14:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:14:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:33,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:33,298 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:33,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -28055909, now seen corresponding path program 1 times [2024-11-10 09:14:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:14:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825568602] [2024-11-10 09:14:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:14:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:14:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:14:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:14:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:14:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:14:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:14:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:14:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:14:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:14:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:14:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:14:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:14:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:14:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:14:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:14:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:14:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:14:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:14:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:14:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:14:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825568602] [2024-11-10 09:14:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825568602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:14:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:14:33,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:14:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913370233] [2024-11-10 09:14:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:14:33,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:14:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:14:33,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:14:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:14:33,766 INFO L87 Difference]: Start difference. First operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:14:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:14:33,805 INFO L93 Difference]: Finished difference Result 200 states and 309 transitions. [2024-11-10 09:14:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:14:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-11-10 09:14:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:14:33,815 INFO L225 Difference]: With dead ends: 200 [2024-11-10 09:14:33,815 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:14:33,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:14:33,821 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:14:33,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:14:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:14:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 09:14:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:14:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-10 09:14:33,862 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 145 [2024-11-10 09:14:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:14:33,863 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-10 09:14:33,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:14:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-10 09:14:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:33,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:33,866 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:14:33,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -500621237, now seen corresponding path program 1 times [2024-11-10 09:14:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:14:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566726531] [2024-11-10 09:14:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:14:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:14:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:14:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:14:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:14:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:14:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:14:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:14:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:14:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:14:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:14:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:14:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:14:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:14:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:14:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:14:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:14:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:14:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:14:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 09:14:35,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:14:35,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566726531] [2024-11-10 09:14:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566726531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:14:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696680119] [2024-11-10 09:14:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:14:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:14:35,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:14:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:14:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:35,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:14:35,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:14:35,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:14:35,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2024-11-10 09:14:35,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-11-10 09:14:35,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:14:35,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2024-11-10 09:14:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-10 09:14:35,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:14:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 09:14:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696680119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:14:36,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:14:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2024-11-10 09:14:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677983415] [2024-11-10 09:14:36,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:14:36,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:14:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:14:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:14:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:14:36,041 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 17 states, 14 states have (on average 5.928571428571429) internal successors, (83), 17 states have internal predecessors, (83), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-10 09:14:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:14:36,687 INFO L93 Difference]: Finished difference Result 307 states and 428 transitions. [2024-11-10 09:14:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 09:14:36,687 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.928571428571429) internal successors, (83), 17 states have internal predecessors, (83), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) Word has length 145 [2024-11-10 09:14:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:14:36,690 INFO L225 Difference]: With dead ends: 307 [2024-11-10 09:14:36,690 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 09:14:36,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 09:14:36,692 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 463 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:14:36,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 863 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:14:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 09:14:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 105. [2024-11-10 09:14:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:14:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-10 09:14:36,707 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 145 [2024-11-10 09:14:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:14:36,708 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-10 09:14:36,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.928571428571429) internal successors, (83), 17 states have internal predecessors, (83), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-10 09:14:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-10 09:14:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:36,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:36,710 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:36,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:14:36,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:14:36,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -909445462, now seen corresponding path program 1 times [2024-11-10 09:14:36,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:14:36,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125067751] [2024-11-10 09:14:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:14:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:14:37,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:14:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:14:37,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:14:37,117 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:14:37,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:14:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:14:37,122 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 09:14:37,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:14:37,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:14:37 BoogieIcfgContainer [2024-11-10 09:14:37,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:14:37,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:14:37,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:14:37,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:14:37,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:14:33" (3/4) ... [2024-11-10 09:14:37,238 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:14:37,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:14:37,243 INFO L158 Benchmark]: Toolchain (without parser) took 5304.71ms. Allocated memory was 155.2MB in the beginning and 257.9MB in the end (delta: 102.8MB). Free memory was 87.1MB in the beginning and 90.9MB in the end (delta: -3.8MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,247 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 112.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:14:37,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.81ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 116.5MB in the end (delta: -29.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.52ms. Allocated memory is still 155.2MB. Free memory was 116.5MB in the beginning and 112.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,248 INFO L158 Benchmark]: Boogie Preprocessor took 80.29ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 107.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,249 INFO L158 Benchmark]: IcfgBuilder took 637.78ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 74.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,249 INFO L158 Benchmark]: TraceAbstraction took 4019.06ms. Allocated memory was 155.2MB in the beginning and 257.9MB in the end (delta: 102.8MB). Free memory was 74.1MB in the beginning and 90.9MB in the end (delta: -16.8MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2024-11-10 09:14:37,249 INFO L158 Benchmark]: Witness Printer took 8.61ms. Allocated memory is still 257.9MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:14:37,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 112.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.81ms. Allocated memory is still 155.2MB. Free memory was 86.9MB in the beginning and 116.5MB in the end (delta: -29.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.52ms. Allocated memory is still 155.2MB. Free memory was 116.5MB in the beginning and 112.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.29ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 107.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 637.78ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 74.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4019.06ms. Allocated memory was 155.2MB in the beginning and 257.9MB in the end (delta: 102.8MB). Free memory was 74.1MB in the beginning and 90.9MB in the end (delta: -16.8MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. * Witness Printer took 8.61ms. Allocated memory is still 257.9MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] EXPR unsigned_char_Array_0[1] [L100] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_unsigned_char_Array_0_1_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-6, unsigned_char_Array_0={8:0}] [L42] COND TRUE last_1_unsigned_char_Array_0_1_ >= stepLocal_0 [L43] EXPR float_Array_0[1] [L43] EXPR float_Array_0[0] [L43] float_Array_0[2] = (float_Array_0[1] + float_Array_0[0]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[0] [L45] EXPR float_Array_0[1] [L45] unsigned char stepLocal_1 = (float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1]; [L46] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][1] && stepLocal_1 [L47] EXPR unsigned_char_Array_0[2] [L47] EXPR unsigned_char_Array_0[0] [L47] unsigned_char_Array_0[1] = (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)) [L51] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L54] EXPR BOOL_unsigned_char_Array_0[0][1] [L54] BOOL_unsigned_char_Array_0[1][1] = (! BOOL_unsigned_char_Array_0[0][1]) [L56] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L59] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L66] EXPR signed_char_Array_0[0][1] [L66] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 [L103] EXPR float_Array_0[2] [L103] EXPR float_Array_0[1] [L103] EXPR float_Array_0[0] [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103-L104] return (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 738 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 573 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 265 mSDtfsCounter, 573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 373 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 106 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 2546 SizeOfPredicates, 5 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2322/2448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:14:37,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:14:39,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:14:39,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:14:39,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:14:39,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:14:39,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:14:39,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:14:39,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:14:39,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:14:39,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:14:39,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:14:39,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:14:39,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:14:39,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:14:39,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:14:39,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:14:39,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:14:39,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:14:39,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:14:39,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:14:39,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:14:39,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:14:39,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:14:39,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:14:39,722 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:14:39,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:14:39,722 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:14:39,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:14:39,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:14:39,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:14:39,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:14:39,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:14:39,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:14:39,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:14:39,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:14:39,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:14:39,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:14:39,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:14:39,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:14:39,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:14:39,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:14:39,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:14:39,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:14:39,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:14:39,726 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2024-11-10 09:14:40,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:14:40,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:14:40,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:14:40,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:14:40,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:14:40,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:41,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:14:41,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:14:41,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:41,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c65ec4cb/2627edd20c534def8a74cc0b989c7a1a/FLAGaddb0b7e3 [2024-11-10 09:14:41,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c65ec4cb/2627edd20c534def8a74cc0b989c7a1a [2024-11-10 09:14:41,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:14:41,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:14:41,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:14:41,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:14:41,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:14:41,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:14:41" (1/1) ... [2024-11-10 09:14:41,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72af3894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:41, skipping insertion in model container [2024-11-10 09:14:41,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:14:41" (1/1) ... [2024-11-10 09:14:41,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:14:42,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-10 09:14:42,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:14:42,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:14:42,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-10 09:14:42,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:14:42,215 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:14:42,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42 WrapperNode [2024-11-10 09:14:42,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:14:42,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:14:42,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:14:42,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:14:42,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,269 INFO L138 Inliner]: procedures = 33, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2024-11-10 09:14:42,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:14:42,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:14:42,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:14:42,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:14:42,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,316 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2024-11-10 09:14:42,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:14:42,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:14:42,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:14:42,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:14:42,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (1/1) ... [2024-11-10 09:14:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:14:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:14:42,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:14:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:14:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:14:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:14:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:14:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:14:42,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:14:42,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:14:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:14:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:14:42,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:14:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:14:42,684 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:14:42,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:14:43,569 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~ite85#1;havoc property_#t~mem75#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short86#1;havoc property_#t~mem87#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short102#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short114#1; [2024-11-10 09:14:43,606 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-10 09:14:43,606 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:14:43,622 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:14:43,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:14:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:14:43 BoogieIcfgContainer [2024-11-10 09:14:43,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:14:43,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:14:43,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:14:43,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:14:43,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:14:41" (1/3) ... [2024-11-10 09:14:43,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8cf919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:14:43, skipping insertion in model container [2024-11-10 09:14:43,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:14:42" (2/3) ... [2024-11-10 09:14:43,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8cf919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:14:43, skipping insertion in model container [2024-11-10 09:14:43,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:14:43" (3/3) ... [2024-11-10 09:14:43,631 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2024-11-10 09:14:43,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:14:43,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:14:43,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:14:43,696 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;@1a5dda10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:14:43,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:14:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:14:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:43,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:43,716 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:43,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:43,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash -28055909, now seen corresponding path program 1 times [2024-11-10 09:14:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:14:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45913863] [2024-11-10 09:14:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:14:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:14:43,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:14:43,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:14:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:44,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:14:44,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:14:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-10 09:14:44,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:14:44,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:14:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45913863] [2024-11-10 09:14:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45913863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:14:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:14:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:14:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708005992] [2024-11-10 09:14:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:14:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:14:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:14:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:14:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:14:44,190 INFO L87 Difference]: Start difference. First operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 84 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:14:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:14:44,223 INFO L93 Difference]: Finished difference Result 200 states and 309 transitions. [2024-11-10 09:14:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:14:44,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-11-10 09:14:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:14:44,232 INFO L225 Difference]: With dead ends: 200 [2024-11-10 09:14:44,233 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:14:44,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:14:44,240 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:14:44,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:14:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:14:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 09:14:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:14:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-10 09:14:44,288 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 145 [2024-11-10 09:14:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:14:44,288 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-10 09:14:44,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:14:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-10 09:14:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:44,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:44,291 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:44,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:14:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:14:44,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -500621237, now seen corresponding path program 1 times [2024-11-10 09:14:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:14:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041849886] [2024-11-10 09:14:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:44,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:14:44,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:14:44,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:14:44,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:14:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:44,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:14:45,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:14:45,054 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 19 treesize of output 1 [2024-11-10 09:14:45,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-10 09:14:45,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-10 09:14:45,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:14:45,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:14:45,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 88 [2024-11-10 09:14:45,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2024-11-10 09:14:45,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:14:45,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 17 [2024-11-10 09:14:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-10 09:14:45,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:14:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 09:14:46,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:14:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041849886] [2024-11-10 09:14:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041849886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:14:46,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:14:46,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-10 09:14:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750395582] [2024-11-10 09:14:46,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:14:46,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:14:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:14:46,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:14:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:14:46,274 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 5 states have call successors, (33) [2024-11-10 09:14:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:14:48,026 INFO L93 Difference]: Finished difference Result 313 states and 433 transitions. [2024-11-10 09:14:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 09:14:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 5 states have call successors, (33) Word has length 145 [2024-11-10 09:14:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:14:48,028 INFO L225 Difference]: With dead ends: 313 [2024-11-10 09:14:48,028 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 09:14:48,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2024-11-10 09:14:48,030 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 344 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:14:48,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 871 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 09:14:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 09:14:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2024-11-10 09:14:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.2967741935483872) internal successors, (201), 156 states have internal predecessors, (201), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:14:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 273 transitions. [2024-11-10 09:14:48,058 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 273 transitions. Word has length 145 [2024-11-10 09:14:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:14:48,059 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 273 transitions. [2024-11-10 09:14:48,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 3 states have call predecessors, (33), 5 states have call successors, (33) [2024-11-10 09:14:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 273 transitions. [2024-11-10 09:14:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:14:48,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:14:48,061 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:14:48,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 09:14:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:14:48,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:14:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:14:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -909445462, now seen corresponding path program 1 times [2024-11-10 09:14:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:14:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207350459] [2024-11-10 09:14:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:14:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:14:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:14:48,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:14:48,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:14:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:14:56,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:14:56,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:14:56,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:14:56,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-10 09:14:58,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:14:58,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 107 [2024-11-10 09:15:12,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:15:12,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 131 [2024-11-10 09:15:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-10 09:15:13,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:15:13,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:15:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207350459] [2024-11-10 09:15:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207350459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:15:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327182758] [2024-11-10 09:15:13,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:15:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:15:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:15:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:15:13,171 INFO L87 Difference]: Start difference. First operand 197 states and 273 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-10 09:15:26,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:15:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:28,284 INFO L93 Difference]: Finished difference Result 878 states and 1205 transitions. [2024-11-10 09:15:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:15:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-11-10 09:15:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:28,300 INFO L225 Difference]: With dead ends: 878 [2024-11-10 09:15:28,304 INFO L226 Difference]: Without dead ends: 684 [2024-11-10 09:15:28,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:15:28,310 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 466 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:28,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1731 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 883 Invalid, 1 Unknown, 0 Unchecked, 13.2s Time] [2024-11-10 09:15:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-10 09:15:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 669. [2024-11-10 09:15:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 530 states have (on average 1.2924528301886793) internal successors, (685), 539 states have internal predecessors, (685), 118 states have call successors, (118), 20 states have call predecessors, (118), 20 states have return successors, (118), 109 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-10 09:15:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 921 transitions. [2024-11-10 09:15:28,498 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 921 transitions. Word has length 145 [2024-11-10 09:15:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:28,500 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 921 transitions. [2024-11-10 09:15:28,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-10 09:15:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 921 transitions. [2024-11-10 09:15:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:15:28,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:28,513 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:15:28,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 09:15:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:28,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -976452215, now seen corresponding path program 1 times [2024-11-10 09:15:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137105693] [2024-11-10 09:15:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:28,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:28,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:15:28,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:15:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:29,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 09:15:29,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:15:29,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:15:29,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:15:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137105693] [2024-11-10 09:15:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137105693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:15:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885858053] [2024-11-10 09:15:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:15:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:15:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:15:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:15:29,057 INFO L87 Difference]: Start difference. First operand 669 states and 921 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:15:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:29,241 INFO L93 Difference]: Finished difference Result 1223 states and 1685 transitions. [2024-11-10 09:15:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:15:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-10 09:15:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:29,256 INFO L225 Difference]: With dead ends: 1223 [2024-11-10 09:15:29,256 INFO L226 Difference]: Without dead ends: 557 [2024-11-10 09:15:29,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:15:29,259 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:29,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:15:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-10 09:15:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 532. [2024-11-10 09:15:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 420 states have (on average 1.2833333333333334) internal successors, (539), 426 states have internal predecessors, (539), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-10 09:15:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 729 transitions. [2024-11-10 09:15:29,345 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 729 transitions. Word has length 145 [2024-11-10 09:15:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:29,346 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 729 transitions. [2024-11-10 09:15:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:15:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 729 transitions. [2024-11-10 09:15:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:15:29,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:29,360 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:15:29,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:15:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:29,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1718932919, now seen corresponding path program 1 times [2024-11-10 09:15:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80904669] [2024-11-10 09:15:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:29,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:15:29,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 09:15:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:29,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:15:29,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-10 09:15:29,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:15:29,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:15:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80904669] [2024-11-10 09:15:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80904669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:29,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774326163] [2024-11-10 09:15:29,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:29,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:15:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:29,885 INFO L87 Difference]: Start difference. First operand 532 states and 729 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:15:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:29,954 INFO L93 Difference]: Finished difference Result 1065 states and 1461 transitions. [2024-11-10 09:15:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-11-10 09:15:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:29,959 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 09:15:29,959 INFO L226 Difference]: Without dead ends: 536 [2024-11-10 09:15:29,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:29,961 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:29,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-10 09:15:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-11-10 09:15:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.275943396226415) internal successors, (541), 430 states have internal predecessors, (541), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-10 09:15:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 731 transitions. [2024-11-10 09:15:30,029 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 731 transitions. Word has length 145 [2024-11-10 09:15:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:30,029 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 731 transitions. [2024-11-10 09:15:30,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:15:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 731 transitions. [2024-11-10 09:15:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:15:30,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:30,032 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:15:30,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 09:15:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:30,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 221341163, now seen corresponding path program 1 times [2024-11-10 09:15:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256428082] [2024-11-10 09:15:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:30,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:15:30,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 09:15:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:30,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:15:30,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-10 09:15:30,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:15:30,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:15:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256428082] [2024-11-10 09:15:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256428082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:15:30,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:15:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:15:30,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117000450] [2024-11-10 09:15:30,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:15:30,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:15:30,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:15:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:15:30,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:30,620 INFO L87 Difference]: Start difference. First operand 536 states and 731 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:15:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:15:30,689 INFO L93 Difference]: Finished difference Result 1069 states and 1459 transitions. [2024-11-10 09:15:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:15:30,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-11-10 09:15:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:15:30,692 INFO L225 Difference]: With dead ends: 1069 [2024-11-10 09:15:30,692 INFO L226 Difference]: Without dead ends: 536 [2024-11-10 09:15:30,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:15:30,694 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:15:30,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:15:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-10 09:15:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-11-10 09:15:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.2712264150943395) internal successors, (539), 430 states have internal predecessors, (539), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-10 09:15:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 729 transitions. [2024-11-10 09:15:30,742 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 729 transitions. Word has length 145 [2024-11-10 09:15:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:15:30,743 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 729 transitions. [2024-11-10 09:15:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:15:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 729 transitions. [2024-11-10 09:15:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 09:15:30,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:15:30,744 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:15:30,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 09:15:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:30,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:15:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:15:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1509387528, now seen corresponding path program 1 times [2024-11-10 09:15:30,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:15:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347998514] [2024-11-10 09:15:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:15:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:15:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:15:30,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:15:30,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 09:15:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:15:57,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 09:15:57,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:15:57,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:15:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-10 09:16:00,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:16:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 105