./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-94.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 9bf81bd1de4778302eee24cc48b6d58814bbba6e1c74d1d34d91571430172fcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:29:52,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:29:52,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:29:52,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:29:52,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:29:52,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:29:52,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:29:52,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:29:52,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:29:52,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:29:52,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:29:52,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:29:52,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:29:52,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:29:52,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:29:52,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:29:52,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:29:52,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:29:52,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:29:52,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:29:52,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9bf81bd1de4778302eee24cc48b6d58814bbba6e1c74d1d34d91571430172fcb [2025-03-17 05:29:52,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:29:52,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:29:52,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:29:52,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:29:52,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:29:52,774 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-94.i [2025-03-17 05:29:54,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8889ee05/acfe0ea3abfa4674be15910ce5266ed9/FLAG5df181450 [2025-03-17 05:29:54,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:29:54,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-94.i [2025-03-17 05:29:54,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8889ee05/acfe0ea3abfa4674be15910ce5266ed9/FLAG5df181450 [2025-03-17 05:29:54,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8889ee05/acfe0ea3abfa4674be15910ce5266ed9 [2025-03-17 05:29:54,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:29:54,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:29:54,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:29:54,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:29:54,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:29:54,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4803923b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54, skipping insertion in model container [2025-03-17 05:29:54,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:29:54,687 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-94.i[916,929] [2025-03-17 05:29:54,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:29:54,766 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:29:54,773 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-94.i[916,929] [2025-03-17 05:29:54,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:29:54,831 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:29:54,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54 WrapperNode [2025-03-17 05:29:54,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:29:54,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:29:54,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:29:54,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:29:54,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,874 INFO L138 Inliner]: procedures = 29, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2025-03-17 05:29:54,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:29:54,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:29:54,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:29:54,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:29:54,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,911 INFO L175 MemorySlicer]: Split 157 memory accesses to 7 slices as follows [2, 21, 56, 16, 45, 5, 12]. 36 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 6, 1, 2]. The 22 writes are split as follows [0, 4, 5, 2, 7, 2, 2]. [2025-03-17 05:29:54,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:29:54,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:29:54,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:29:54,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:29:54,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (1/1) ... [2025-03-17 05:29:54,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:29:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:29:54,980 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) [2025-03-17 05:29:54,985 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 [2025-03-17 05:29:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:29:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:29:55,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:29:55,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:29:55,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:29:55,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:29:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:29:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:29:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:29:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:29:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:29:55,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:29:55,149 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:29:55,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:29:55,570 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite132#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem127#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~ite147#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite163#1;havoc property_#t~mem153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite160#1;havoc property_#t~mem156#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem157#1;havoc property_#t~ite159#1;havoc property_#t~mem158#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short164#1; [2025-03-17 05:29:55,616 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-17 05:29:55,616 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:29:55,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:29:55,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:29:55,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:29:55 BoogieIcfgContainer [2025-03-17 05:29:55,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:29:55,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:29:55,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:29:55,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:29:55,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:29:54" (1/3) ... [2025-03-17 05:29:55,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84bd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:29:55, skipping insertion in model container [2025-03-17 05:29:55,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:29:54" (2/3) ... [2025-03-17 05:29:55,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84bd3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:29:55, skipping insertion in model container [2025-03-17 05:29:55,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:29:55" (3/3) ... [2025-03-17 05:29:55,637 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-94.i [2025-03-17 05:29:55,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:29:55,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-94.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:29:55,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:29:55,708 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;@1cf03d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:29:55,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:29:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:29:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:29:55,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:55,725 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:55,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:55,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1945120877, now seen corresponding path program 1 times [2025-03-17 05:29:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:29:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366381724] [2025-03-17 05:29:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:29:55,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:55,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:55,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 05:29:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:29:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366381724] [2025-03-17 05:29:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366381724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:29:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885071712] [2025-03-17 05:29:56,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:56,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:29:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:29:56,040 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) [2025-03-17 05:29:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:29:56,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:56,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:56,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:29:56,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:29:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-17 05:29:56,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:29:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885071712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:56,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:29:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:29:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686494523] [2025-03-17 05:29:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:29:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:29:56,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:29:56,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:29:56,337 INFO L87 Difference]: Start difference. First operand has 130 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:56,367 INFO L93 Difference]: Finished difference Result 257 states and 413 transitions. [2025-03-17 05:29:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:29:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:29:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:56,376 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:29:56,377 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 05:29:56,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:29:56,384 INFO L435 NwaCegarLoop]: 191 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, 191 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 [2025-03-17 05:29:56,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:29:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 05:29:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-17 05:29:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:29:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2025-03-17 05:29:56,428 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 190 [2025-03-17 05:29:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:56,429 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2025-03-17 05:29:56,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2025-03-17 05:29:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:29:56,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:56,435 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:56,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:29:56,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:29:56,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:56,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash 148023522, now seen corresponding path program 1 times [2025-03-17 05:29:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:29:56,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529191566] [2025-03-17 05:29:56,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:29:56,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:29:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:29:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529191566] [2025-03-17 05:29:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529191566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:29:56,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:29:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129375000] [2025-03-17 05:29:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:29:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:29:56,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:29:56,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:29:56,908 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:56,950 INFO L93 Difference]: Finished difference Result 257 states and 384 transitions. [2025-03-17 05:29:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:29:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:29:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:56,953 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:29:56,953 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 05:29:56,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:29:56,954 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:56,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:29:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 05:29:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 05:29:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:29:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2025-03-17 05:29:56,972 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 190 [2025-03-17 05:29:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2025-03-17 05:29:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2025-03-17 05:29:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:29:56,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:56,976 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:29:56,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1010327683, now seen corresponding path program 1 times [2025-03-17 05:29:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:29:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178487547] [2025-03-17 05:29:56,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:29:57,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:57,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:57,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:57,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:29:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-17 05:29:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:29:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178487547] [2025-03-17 05:29:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178487547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:29:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:29:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:29:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446372075] [2025-03-17 05:29:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:29:57,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:29:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:29:57,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:29:57,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:29:57,198 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:29:57,239 INFO L93 Difference]: Finished difference Result 261 states and 388 transitions. [2025-03-17 05:29:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:29:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:29:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:29:57,241 INFO L225 Difference]: With dead ends: 261 [2025-03-17 05:29:57,241 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 05:29:57,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:29:57,243 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:29:57,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:29:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 05:29:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 05:29:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:29:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2025-03-17 05:29:57,259 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 190 [2025-03-17 05:29:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:29:57,259 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2025-03-17 05:29:57,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:29:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2025-03-17 05:29:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:29:57,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:29:57,260 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:29:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:29:57,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:29:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:29:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1282763970, now seen corresponding path program 1 times [2025-03-17 05:29:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:29:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503821152] [2025-03-17 05:29:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:29:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:29:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:57,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:57,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:57,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:29:57,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:29:57,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:29:57,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:29:57,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:29:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:29:57,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:29:57,626 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:29:57,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:29:57,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:29:57,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:29:57,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:29:57,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:29:57 BoogieIcfgContainer [2025-03-17 05:29:57,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:29:57,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:29:57,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:29:57,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:29:57,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:29:55" (3/4) ... [2025-03-17 05:29:57,743 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:29:57,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:29:57,744 INFO L158 Benchmark]: Toolchain (without parser) took 3186.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 52.0MB in the end (delta: 59.9MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-03-17 05:29:57,744 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:29:57,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:29:57,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:29:57,745 INFO L158 Benchmark]: Boogie Preprocessor took 74.53ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 87.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:29:57,746 INFO L158 Benchmark]: IcfgBuilder took 677.34ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 49.7MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:29:57,746 INFO L158 Benchmark]: TraceAbstraction took 2106.98ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 52.0MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:29:57,746 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:29:57,747 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.21ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.98ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.53ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 87.2MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 677.34ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 49.7MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2106.98ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 52.0MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 52.0MB in the beginning and 52.0MB in the end (delta: 24.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L25-L27] double double_Array_0[5] = { 63.75, 3.7, 63.4, 0.0, 63.4 }; [L28-L30] float float_Array_0[2] = { 3.75, 25.2 }; [L28-L30] float float_Array_0[2] = { 3.75, 25.2 }; [L28-L30] float float_Array_0[2] = { 3.75, 25.2 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {-32, -64, -4}, {2, 5, -25} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -2 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -2 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] double_Array_0[0] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] CALL assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] RET assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] double_Array_0[2] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] double_Array_0[3] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[3] >= 4611686.018427382800e+12F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] float_Array_0[0] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[0] [L86] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L86] EXPR float_Array_0[0] [L86] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] float_Array_0[1] = __VERIFIER_nondet_float() [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L93] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0][2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(signed_char_Array_0[0][2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] signed_char_Array_0[1][2] = __VERIFIER_nondet_char() [L102] EXPR signed_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L102] CALL assume_abort_if_not(signed_char_Array_0[1][2] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L102] RET assume_abort_if_not(signed_char_Array_0[1][2] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L103] EXPR signed_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L103] CALL assume_abort_if_not(signed_char_Array_0[1][2] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L103] RET assume_abort_if_not(signed_char_Array_0[1][2] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L104] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L106] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L107] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L122] RET updateVariables() [L123] CALL step() [L43] EXPR float_Array_0[1] [L43] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] COND TRUE float_Array_0[1] != float_Array_0[0] [L44] EXPR double_Array_0[3] [L44] EXPR double_Array_0[2] [L44] EXPR double_Array_0[1] [L44] double_Array_0[4] = ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]) [L46] EXPR double_Array_0[2] [L46] EXPR double_Array_0[4] [L46] EXPR double_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L46] COND FALSE !(double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) [L53] EXPR BOOL_unsigned_char_Array_0[1] [L53] BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] COND TRUE BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0] [L54] EXPR signed_char_Array_0[0][0] [L54] signed_char_Array_0[0][1] = signed_char_Array_0[0][0] [L58] EXPR signed_char_Array_0[1][2] [L58] signed char stepLocal_0 = signed_char_Array_0[1][2]; [L59] EXPR double_Array_0[1] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L59] COND FALSE !(double_Array_0[1] > double_Array_0[2]) [L66] EXPR signed_char_Array_0[1][0] [L66] signed_long_int_Array_0[0] = signed_char_Array_0[1][0] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR float_Array_0[1] [L114] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR (float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1 [L114] EXPR double_Array_0[4] [L114] EXPR double_Array_0[3] [L114] EXPR double_Array_0[2] [L114] EXPR double_Array_0[1] [L114] EXPR (float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR ((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR ((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR (((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[0][1] == ((signed char) signed_char_Array_0[0][0])) : (signed_char_Array_0[0][1] == ((signed char) (((((signed_char_Array_0[1][0]) > (signed_char_Array_0[0][2])) ? (signed_char_Array_0[1][0]) : (signed_char_Array_0[0][2]))) + (signed_char_Array_0[1][2] + signed_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR (((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[0][1] == ((signed char) signed_char_Array_0[0][0])) : (signed_char_Array_0[0][1] == ((signed char) (((((signed_char_Array_0[1][0]) > (signed_char_Array_0[0][2])) ? (signed_char_Array_0[1][0]) : (signed_char_Array_0[0][2]))) + (signed_char_Array_0[1][2] + signed_char_Array_0[1][1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR ((((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[0][1] == ((signed char) signed_char_Array_0[0][0])) : (signed_char_Array_0[0][1] == ((signed char) (((((signed_char_Array_0[1][0]) > (signed_char_Array_0[0][2])) ? (signed_char_Array_0[1][0]) : (signed_char_Array_0[0][2]))) + (signed_char_Array_0[1][2] + signed_char_Array_0[1][1])))))) && ((double_Array_0[1] > double_Array_0[2]) ? ((double_Array_0[4] != (double_Array_0[3] / double_Array_0[0])) ? (((signed_char_Array_0[0][1] % (unsigned_char_Array_0[0] + unsigned_char_Array_0[1])) > signed_char_Array_0[1][2]) ? (signed_long_int_Array_0[0] == ((signed long int) -64)) : 1) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114] EXPR ((((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[0][1] == ((signed char) signed_char_Array_0[0][0])) : (signed_char_Array_0[0][1] == ((signed char) (((((signed_char_Array_0[1][0]) > (signed_char_Array_0[0][2])) ? (signed_char_Array_0[1][0]) : (signed_char_Array_0[0][2]))) + (signed_char_Array_0[1][2] + signed_char_Array_0[1][1])))))) && ((double_Array_0[1] > double_Array_0[2]) ? ((double_Array_0[4] != (double_Array_0[3] / double_Array_0[0])) ? (((signed_char_Array_0[0][1] % (unsigned_char_Array_0[0] + unsigned_char_Array_0[1])) > signed_char_Array_0[1][2]) ? (signed_long_int_Array_0[0] == ((signed long int) -64)) : 1) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L114-L115] return ((((float_Array_0[1] != float_Array_0[0]) ? (double_Array_0[4] == ((double) ((double_Array_0[3] - double_Array_0[2]) - double_Array_0[1]))) : 1) && ((double_Array_0[2] > (double_Array_0[4] / double_Array_0[3])) ? ((double_Array_0[2] > (double_Array_0[3] / double_Array_0[0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : (BOOL_unsigned_char_Array_0[2] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[0][1] == ((signed char) signed_char_Array_0[0][0])) : (signed_char_Array_0[0][1] == ((signed char) (((((signed_char_Array_0[1][0]) > (signed_char_Array_0[0][2])) ? (signed_char_Array_0[1][0]) : (signed_char_Array_0[0][2]))) + (signed_char_Array_0[1][2] + signed_char_Array_0[1][1])))))) && ((double_Array_0[1] > double_Array_0[2]) ? ((double_Array_0[4] != (double_Array_0[3] / double_Array_0[0])) ? (((signed_char_Array_0[0][1] % (unsigned_char_Array_0[0] + unsigned_char_Array_0[1])) > signed_char_Array_0[1][2]) ? (signed_long_int_Array_0[0] == ((signed long int) -64)) : 1) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 220 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1303 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 734 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 569 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 625 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4752/4800 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:29:57,770 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/21.0.5-tem/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.6.800.v20240513-1750.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-94.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 9bf81bd1de4778302eee24cc48b6d58814bbba6e1c74d1d34d91571430172fcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:30:00,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:30:00,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:30:00,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:30:00,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:30:00,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:30:00,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:30:00,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:30:00,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:30:00,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:30:00,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:30:00,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:30:00,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:30:00,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:30:00,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:30:00,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:00,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:30:00,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:30:00,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9bf81bd1de4778302eee24cc48b6d58814bbba6e1c74d1d34d91571430172fcb [2025-03-17 05:30:00,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:30:00,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:30:00,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:30:00,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:30:00,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:30:00,502 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-94.i [2025-03-17 05:30:01,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c495178d/146b86802b4f47f0ac89625e395f5edb/FLAG4de38464b [2025-03-17 05:30:01,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:30:01,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-94.i [2025-03-17 05:30:01,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c495178d/146b86802b4f47f0ac89625e395f5edb/FLAG4de38464b [2025-03-17 05:30:02,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c495178d/146b86802b4f47f0ac89625e395f5edb [2025-03-17 05:30:02,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:30:02,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:30:02,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:02,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:30:02,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:30:02,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a21801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02, skipping insertion in model container [2025-03-17 05:30:02,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:30:02,456 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-94.i[916,929] [2025-03-17 05:30:02,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:02,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:30:02,562 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-94.i[916,929] [2025-03-17 05:30:02,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:02,655 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:30:02,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02 WrapperNode [2025-03-17 05:30:02,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:02,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:02,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:30:02,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:30:02,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,715 INFO L138 Inliner]: procedures = 36, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 573 [2025-03-17 05:30:02,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:02,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:30:02,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:30:02,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:30:02,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,750 INFO L175 MemorySlicer]: Split 157 memory accesses to 7 slices as follows [2, 21, 56, 16, 45, 5, 12]. 36 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 6, 1, 2]. The 22 writes are split as follows [0, 4, 5, 2, 7, 2, 2]. [2025-03-17 05:30:02,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:30:02,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:30:02,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:30:02,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:30:02,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (1/1) ... [2025-03-17 05:30:02,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:02,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:02,814 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) [2025-03-17 05:30:02,821 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 [2025-03-17 05:30:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:30:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:30:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:30:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:30:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:30:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:30:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:30:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:30:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:30:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:30:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:30:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:30:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:30:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:30:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:30:02,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:30:02,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:30:51,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite132#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem127#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~ite147#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~mem146#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite163#1;havoc property_#t~mem153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite160#1;havoc property_#t~mem156#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem157#1;havoc property_#t~ite159#1;havoc property_#t~mem158#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short164#1; [2025-03-17 05:30:51,435 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-17 05:30:51,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:30:51,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:30:51,448 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:30:51,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:51 BoogieIcfgContainer [2025-03-17 05:30:51,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:30:51,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:30:51,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:30:51,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:30:51,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:30:02" (1/3) ... [2025-03-17 05:30:51,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46176f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:51, skipping insertion in model container [2025-03-17 05:30:51,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:02" (2/3) ... [2025-03-17 05:30:51,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46176f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:51, skipping insertion in model container [2025-03-17 05:30:51,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:51" (3/3) ... [2025-03-17 05:30:51,454 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-94.i [2025-03-17 05:30:51,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:30:51,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-94.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:30:51,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:30:51,516 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;@f9b8a08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:30:51,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:30:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:30:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:30:51,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:51,530 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:51,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:51,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1945120877, now seen corresponding path program 1 times [2025-03-17 05:30:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788271980] [2025-03-17 05:30:51,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:51,541 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 [2025-03-17 05:30:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:51,544 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) [2025-03-17 05:30:51,546 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 [2025-03-17 05:30:51,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:30:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:30:52,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:52,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:52,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:30:52,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-17 05:30:52,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:52,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788271980] [2025-03-17 05:30:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788271980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:30:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824592491] [2025-03-17 05:30:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:52,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:30:52,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:30:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:30:52,810 INFO L87 Difference]: Start difference. First operand has 130 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:52,832 INFO L93 Difference]: Finished difference Result 257 states and 413 transitions. [2025-03-17 05:30:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:30:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:30:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:52,840 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:30:52,841 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 05:30:52,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:30:52,849 INFO L435 NwaCegarLoop]: 191 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, 191 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 [2025-03-17 05:30:52,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 05:30:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-17 05:30:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:30:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2025-03-17 05:30:52,882 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 190 [2025-03-17 05:30:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:52,882 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2025-03-17 05:30:52,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2025-03-17 05:30:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:30:52,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:52,885 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:52,915 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 [2025-03-17 05:30:53,085 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 [2025-03-17 05:30:53,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:53,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash 148023522, now seen corresponding path program 1 times [2025-03-17 05:30:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:53,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561386756] [2025-03-17 05:30:53,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:53,087 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 [2025-03-17 05:30:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:53,089 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) [2025-03-17 05:30:53,090 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 [2025-03-17 05:30:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:30:54,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:30:54,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:54,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:54,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:54,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-03-17 05:30:54,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:54,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561386756] [2025-03-17 05:30:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561386756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:30:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287396925] [2025-03-17 05:30:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:54,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:54,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:54,474 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:54,722 INFO L93 Difference]: Finished difference Result 257 states and 384 transitions. [2025-03-17 05:30:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:30:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:54,725 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:30:54,725 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 05:30:54,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:54,726 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:54,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 05:30:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 05:30:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:30:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2025-03-17 05:30:54,735 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 190 [2025-03-17 05:30:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2025-03-17 05:30:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2025-03-17 05:30:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:30:54,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:54,743 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:54,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 (3)] Ended with exit code 0 [2025-03-17 05:30:54,944 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 [2025-03-17 05:30:54,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1010327683, now seen corresponding path program 1 times [2025-03-17 05:30:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879138281] [2025-03-17 05:30:54,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:54,945 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 [2025-03-17 05:30:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:54,961 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) [2025-03-17 05:30:54,962 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 [2025-03-17 05:30:55,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:30:55,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:30:55,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:55,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:56,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:56,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-03-17 05:30:56,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:56,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879138281] [2025-03-17 05:30:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879138281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:56,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:30:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909378328] [2025-03-17 05:30:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:56,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:56,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:56,160 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:56,352 INFO L93 Difference]: Finished difference Result 261 states and 388 transitions. [2025-03-17 05:30:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-03-17 05:30:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:56,354 INFO L225 Difference]: With dead ends: 261 [2025-03-17 05:30:56,354 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 05:30:56,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:56,355 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:56,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 05:30:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 05:30:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:30:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2025-03-17 05:30:56,362 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 190 [2025-03-17 05:30:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:56,363 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2025-03-17 05:30:56,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:30:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2025-03-17 05:30:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 05:30:56,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:56,365 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:56,394 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 [2025-03-17 05:30:56,565 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 [2025-03-17 05:30:56,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:56,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1282763970, now seen corresponding path program 1 times [2025-03-17 05:30:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592122581] [2025-03-17 05:30:56,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:56,567 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 [2025-03-17 05:30:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:56,602 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) [2025-03-17 05:30:56,603 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 [2025-03-17 05:30:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 05:30:57,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 05:30:57,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:57,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:57,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:30:57,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:58,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:58,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:30:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-03-17 05:30:59,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:59,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592122581] [2025-03-17 05:30:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592122581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810284324] [2025-03-17 05:30:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:59,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:59,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:59,114 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 05:31:02,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:06,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:10,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:14,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:18,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:22,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:26,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:30,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:34,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:31:38,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []