./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:21:28,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:21:28,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:21:28,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:21:28,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:21:28,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:21:28,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:21:28,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:21:28,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:21:28,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:21:28,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:21:28,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:21:28,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:21:28,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:21:28,823 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:21:28,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:21:28,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:21:28,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:28,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:21:28,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:21:28,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:21:28,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:21:28,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:21:28,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:21:28,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:21:28,826 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-jdk21/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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2025-02-06 03:21:29,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:21:29,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:21:29,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:21:29,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:21:29,117 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:21:29,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:30,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a645ee7c/2afe309feea140359732a71ac07853cd/FLAGd3e9c3a8e [2025-02-06 03:21:30,711 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:21:30,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:30,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a645ee7c/2afe309feea140359732a71ac07853cd/FLAGd3e9c3a8e [2025-02-06 03:21:30,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a645ee7c/2afe309feea140359732a71ac07853cd [2025-02-06 03:21:30,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:21:30,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:21:30,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:30,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:21:31,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:21:31,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:30" (1/1) ... [2025-02-06 03:21:31,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302a4955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31, skipping insertion in model container [2025-02-06 03:21:31,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:30" (1/1) ... [2025-02-06 03:21:31,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:21:31,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2025-02-06 03:21:31,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:31,262 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:21:31,272 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2025-02-06 03:21:31,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:31,359 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:21:31,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31 WrapperNode [2025-02-06 03:21:31,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:31,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:31,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:21:31,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:21:31,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,432 INFO L138 Inliner]: procedures = 29, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 767 [2025-02-06 03:21:31,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:31,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:21:31,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:21:31,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:21:31,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,484 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2025-02-06 03:21:31,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:21:31,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:21:31,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:21:31,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:21:31,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (1/1) ... [2025-02-06 03:21:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:31,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:21:31,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:21:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:21:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:21:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:21:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:21:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:21:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:21:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:21:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:21:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:21:31,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:21:31,792 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:21:31,796 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:21:32,442 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem139#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem143#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~ite158#1;havoc property_#t~mem157#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~short159#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~short162#1;havoc property_#t~ite226#1;havoc property_#t~mem177#1;havoc property_#t~mem176#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem168#1;havoc property_#t~ite175#1;havoc property_#t~mem169#1;havoc property_#t~mem170#1;havoc property_#t~ite173#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~mem174#1;havoc property_#t~mem180#1;havoc property_#t~mem178#1;havoc property_#t~bitwise179#1;havoc property_#t~ite225#1;havoc property_#t~mem221#1;havoc property_#t~mem181#1;havoc property_#t~mem182#1;havoc property_#t~mem183#1;havoc property_#t~ite186#1;havoc property_#t~mem184#1;havoc property_#t~mem185#1;havoc property_#t~ite193#1;havoc property_#t~mem187#1;havoc property_#t~mem188#1;havoc property_#t~mem189#1;havoc property_#t~ite192#1;havoc property_#t~mem190#1;havoc property_#t~mem191#1;havoc property_#t~ite220#1;havoc property_#t~mem194#1;havoc property_#t~mem195#1;havoc property_#t~mem196#1;havoc property_#t~ite199#1;havoc property_#t~mem197#1;havoc property_#t~mem198#1;havoc property_#t~ite206#1;havoc property_#t~mem200#1;havoc property_#t~mem201#1;havoc property_#t~mem202#1;havoc property_#t~ite205#1;havoc property_#t~mem203#1;havoc property_#t~mem204#1;havoc property_#t~mem207#1;havoc property_#t~mem208#1;havoc property_#t~mem209#1;havoc property_#t~ite212#1;havoc property_#t~mem210#1;havoc property_#t~mem211#1;havoc property_#t~ite219#1;havoc property_#t~mem213#1;havoc property_#t~mem214#1;havoc property_#t~mem215#1;havoc property_#t~ite218#1;havoc property_#t~mem216#1;havoc property_#t~mem217#1;havoc property_#t~mem224#1;havoc property_#t~mem222#1;havoc property_#t~mem223#1;havoc property_#t~short227#1;havoc property_#t~mem229#1;havoc property_#t~mem228#1;havoc property_#t~short230#1; [2025-02-06 03:21:32,510 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-02-06 03:21:32,511 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:21:32,531 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:21:32,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:21:32,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:32 BoogieIcfgContainer [2025-02-06 03:21:32,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:21:32,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:21:32,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:21:32,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:21:32,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:21:30" (1/3) ... [2025-02-06 03:21:32,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:32, skipping insertion in model container [2025-02-06 03:21:32,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:31" (2/3) ... [2025-02-06 03:21:32,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:32, skipping insertion in model container [2025-02-06 03:21:32,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:32" (3/3) ... [2025-02-06 03:21:32,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:32,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:21:32,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-86.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:21:32,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:21:32,634 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;@52e5e771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:21:32,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:21:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 131 states have internal predecessors, (186), 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-02-06 03:21:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:32,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:32,650 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] [2025-02-06 03:21:32,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1886942763, now seen corresponding path program 1 times [2025-02-06 03:21:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554841948] [2025-02-06 03:21:32,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:32,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:32,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:32,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-06 03:21:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:33,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554841948] [2025-02-06 03:21:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554841948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:33,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819717316] [2025-02-06 03:21:33,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:33,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:21:33,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:21:33,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:33,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:33,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:33,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:33,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:21:33,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-02-06 03:21:33,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819717316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:21:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312563918] [2025-02-06 03:21:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:33,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:21:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:21:33,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:21:33,400 INFO L87 Difference]: Start difference. First operand has 158 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 131 states have internal predecessors, (186), 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-02-06 03:21:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:33,445 INFO L93 Difference]: Finished difference Result 310 states and 492 transitions. [2025-02-06 03:21:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:21:33,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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 185 [2025-02-06 03:21:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:33,456 INFO L225 Difference]: With dead ends: 310 [2025-02-06 03:21:33,456 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 03:21:33,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-02-06 03:21:33,461 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:33,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 03:21:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-06 03:21:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 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-02-06 03:21:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2025-02-06 03:21:33,516 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 185 [2025-02-06 03:21:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:33,517 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2025-02-06 03:21:33,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-02-06 03:21:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2025-02-06 03:21:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:33,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:33,522 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] [2025-02-06 03:21:33,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:21:33,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:21:33,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:33,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1985819524, now seen corresponding path program 1 times [2025-02-06 03:21:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176138139] [2025-02-06 03:21:33,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:33,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:33,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176138139] [2025-02-06 03:21:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176138139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:34,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929785045] [2025-02-06 03:21:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:34,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:34,100 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 03:21:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:34,153 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2025-02-06 03:21:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 185 [2025-02-06 03:21:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:34,156 INFO L225 Difference]: With dead ends: 309 [2025-02-06 03:21:34,156 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 03:21:34,156 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-02-06 03:21:34,157 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:34,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 03:21:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 03:21:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 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-02-06 03:21:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2025-02-06 03:21:34,180 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 185 [2025-02-06 03:21:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:34,182 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2025-02-06 03:21:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 03:21:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2025-02-06 03:21:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:34,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:34,188 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] [2025-02-06 03:21:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:21:34,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1020256707, now seen corresponding path program 1 times [2025-02-06 03:21:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798223053] [2025-02-06 03:21:34,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:34,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:34,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:34,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798223053] [2025-02-06 03:21:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798223053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958530010] [2025-02-06 03:21:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:34,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:34,466 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:34,516 INFO L93 Difference]: Finished difference Result 314 states and 467 transitions. [2025-02-06 03:21:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2025-02-06 03:21:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:34,519 INFO L225 Difference]: With dead ends: 314 [2025-02-06 03:21:34,519 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 03:21:34,520 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-02-06 03:21:34,521 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:34,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 03:21:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2025-02-06 03:21:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 132 states have internal predecessors, (185), 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-02-06 03:21:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 235 transitions. [2025-02-06 03:21:34,531 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 235 transitions. Word has length 185 [2025-02-06 03:21:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:34,532 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 235 transitions. [2025-02-06 03:21:34,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 235 transitions. [2025-02-06 03:21:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:34,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:34,537 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] [2025-02-06 03:21:34,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:21:34,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:34,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1021180228, now seen corresponding path program 1 times [2025-02-06 03:21:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533951983] [2025-02-06 03:21:34,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:34,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:34,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:34,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:34,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:35,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533951983] [2025-02-06 03:21:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533951983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227455795] [2025-02-06 03:21:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:35,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:35,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:35,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:35,163 INFO L87 Difference]: Start difference. First operand 159 states and 235 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:35,323 INFO L93 Difference]: Finished difference Result 437 states and 648 transitions. [2025-02-06 03:21:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2025-02-06 03:21:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:35,326 INFO L225 Difference]: With dead ends: 437 [2025-02-06 03:21:35,326 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:21:35,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:35,328 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 166 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:35,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1184 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:21:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-02-06 03:21:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 241 states have (on average 1.4315352697095436) internal successors, (345), 242 states have internal predecessors, (345), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 413 transitions. [2025-02-06 03:21:35,352 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 413 transitions. Word has length 185 [2025-02-06 03:21:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:35,353 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 413 transitions. [2025-02-06 03:21:35,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 413 transitions. [2025-02-06 03:21:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 03:21:35,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:35,358 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] [2025-02-06 03:21:35,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:21:35,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:35,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash -627185530, now seen corresponding path program 1 times [2025-02-06 03:21:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469123801] [2025-02-06 03:21:35,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:35,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:35,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469123801] [2025-02-06 03:21:36,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469123801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:36,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:36,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731000766] [2025-02-06 03:21:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:36,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:36,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:36,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:36,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:36,398 INFO L87 Difference]: Start difference. First operand 278 states and 413 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:21:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:36,512 INFO L93 Difference]: Finished difference Result 554 states and 820 transitions. [2025-02-06 03:21:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:36,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 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 187 [2025-02-06 03:21:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:36,516 INFO L225 Difference]: With dead ends: 554 [2025-02-06 03:21:36,516 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:21:36,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:36,518 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 230 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:36,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 984 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:21:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-02-06 03:21:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.4142259414225942) internal successors, (338), 240 states have internal predecessors, (338), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 406 transitions. [2025-02-06 03:21:36,546 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 406 transitions. Word has length 187 [2025-02-06 03:21:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 406 transitions. [2025-02-06 03:21:36,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:21:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 406 transitions. [2025-02-06 03:21:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 03:21:36,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:36,549 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] [2025-02-06 03:21:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:21:36,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:36,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1137719707, now seen corresponding path program 1 times [2025-02-06 03:21:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042403056] [2025-02-06 03:21:36,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:36,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:36,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:36,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:37,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:37,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042403056] [2025-02-06 03:21:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042403056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984624462] [2025-02-06 03:21:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:37,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:37,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:37,179 INFO L87 Difference]: Start difference. First operand 277 states and 406 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:21:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:37,328 INFO L93 Difference]: Finished difference Result 553 states and 810 transitions. [2025-02-06 03:21:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 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 187 [2025-02-06 03:21:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:37,331 INFO L225 Difference]: With dead ends: 553 [2025-02-06 03:21:37,331 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:21:37,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:37,334 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 111 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:37,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1365 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:21:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-02-06 03:21:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.4100418410041842) internal successors, (337), 240 states have internal predecessors, (337), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2025-02-06 03:21:37,358 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 187 [2025-02-06 03:21:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:37,359 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2025-02-06 03:21:37,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:21:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2025-02-06 03:21:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 03:21:37,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:37,362 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] [2025-02-06 03:21:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:21:37,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:37,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1646957086, now seen corresponding path program 1 times [2025-02-06 03:21:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454057377] [2025-02-06 03:21:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:37,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:37,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:37,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:37,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-02-06 03:21:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454057377] [2025-02-06 03:21:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454057377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468088166] [2025-02-06 03:21:38,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:38,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:38,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:21:38,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:21:38,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:38,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:38,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:38,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:21:38,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:38,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:21:38,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:21:38,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-06 03:21:38,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:21:38,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-06 03:21:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 442 proven. 15 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-02-06 03:21:38,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-02-06 03:21:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468088166] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:39,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 03:21:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753506747] [2025-02-06 03:21:39,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:39,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:21:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:39,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:21:39,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:21:39,228 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand has 17 states, 14 states have (on average 6.714285714285714) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) [2025-02-06 03:21:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:40,903 INFO L93 Difference]: Finished difference Result 662 states and 951 transitions. [2025-02-06 03:21:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:21:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 6.714285714285714) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) Word has length 187 [2025-02-06 03:21:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:40,908 INFO L225 Difference]: With dead ends: 662 [2025-02-06 03:21:40,911 INFO L226 Difference]: Without dead ends: 388 [2025-02-06 03:21:40,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:21:40,913 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 740 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1256 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:21:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-06 03:21:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 365. [2025-02-06 03:21:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 297 states have (on average 1.3535353535353536) internal successors, (402), 299 states have internal predecessors, (402), 59 states have call successors, (59), 8 states have call predecessors, (59), 8 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 03:21:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 520 transitions. [2025-02-06 03:21:40,957 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 520 transitions. Word has length 187 [2025-02-06 03:21:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 520 transitions. [2025-02-06 03:21:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 6.714285714285714) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 6 states have call successors, (37) [2025-02-06 03:21:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 520 transitions. [2025-02-06 03:21:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 03:21:40,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:40,962 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] [2025-02-06 03:21:40,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:21:41,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:41,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1549246928, now seen corresponding path program 1 times [2025-02-06 03:21:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356290427] [2025-02-06 03:21:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:41,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 03:21:41,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 03:21:41,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:41,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:21:41,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:21:41,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 03:21:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 03:21:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:41,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:21:41,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:21:41,507 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:21:41,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:21:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:21:41,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:21:41,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:21:41,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:21:41 BoogieIcfgContainer [2025-02-06 03:21:41,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:21:41,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:21:41,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:21:41,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:21:41,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:32" (3/4) ... [2025-02-06 03:21:41,641 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:21:41,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:21:41,644 INFO L158 Benchmark]: Toolchain (without parser) took 10644.91ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 122.9MB in the beginning and 179.2MB in the end (delta: -56.3MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,644 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:21:41,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.40ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 104.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.42ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 97.8MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,645 INFO L158 Benchmark]: Boogie Preprocessor took 116.77ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 91.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,646 INFO L158 Benchmark]: IcfgBuilder took 977.17ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 40.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,646 INFO L158 Benchmark]: TraceAbstraction took 9101.34ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 40.8MB in the beginning and 179.3MB in the end (delta: -138.5MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2025-02-06 03:21:41,646 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 444.6MB. Free memory was 179.3MB in the beginning and 179.2MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:21:41,648 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.26ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.40ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 104.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.42ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 97.8MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.77ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 91.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 977.17ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 40.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9101.34ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 40.8MB in the beginning and 179.3MB in the end (delta: -138.5MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 444.6MB. Free memory was 179.3MB in the beginning and 179.2MB in the end (delta: 48.9kB). 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 shiftLeft at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L61] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[0][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[1][0] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[0][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L83] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L86] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L112] RET updateVariables() [L113] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1]) [L43] EXPR signed_short_int_Array_0[1] [L43] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L45] EXPR signed_short_int_Array_0[1] [L45] signed short int stepLocal_0 = signed_short_int_Array_0[1]; [L46] COND TRUE stepLocal_0 > 2 [L47] EXPR float_Array_0[1][0] [L47] EXPR float_Array_0[0][0] [L47] EXPR float_Array_0[0][1] [L47] float_Array_0[1][1] = ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]) [L49] EXPR unsigned_short_int_Array_0[1][1] [L49] unsigned_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[0] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) [L53] EXPR signed_short_int_Array_0[3] [L53] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR -25 << unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) [L56] EXPR unsigned_short_int_Array_0[1][1] [L56] EXPR unsigned_short_int_Array_0[1][2] [L56] unsigned_short_int_Array_0[1][0] = (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) [L104] EXPR signed_short_int_Array_0[4] [L104] EXPR signed_short_int_Array_0[1] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) [L104] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 [L104] EXPR float_Array_0[1][1] [L104] EXPR float_Array_0[1][0] [L104] EXPR float_Array_0[0][0] [L104] EXPR float_Array_0[0][1] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104-L105] return ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1269 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1248 mSDsluCounter, 6357 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4556 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1582 IncrementalHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 1801 mSDtfsCounter, 1582 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1850 ConstructedInterpolants, 0 QuantifiedInterpolants, 3231 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 11907/12000 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-02-06 03:21:41,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:21:44,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:21:44,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:21:44,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:21:44,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:21:44,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:21:44,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:21:44,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:21:44,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:21:44,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:21:44,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:21:44,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:21:44,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:21:44,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:21:44,154 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:21:44,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:21:44,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:21:44,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:21:44,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:21:44,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:21:44,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:21:44,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:21:44,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:21:44,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:21:44,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:44,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:21:44,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:21:44,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:21:44,159 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-jdk21/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 -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2025-02-06 03:21:44,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:21:44,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:21:44,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:21:44,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:21:44,450 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:21:44,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:45,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caeff1df4/aa3cfcb442f14c299f6c9679c4c0a5d6/FLAG9669d2dea [2025-02-06 03:21:46,022 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:21:46,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:46,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caeff1df4/aa3cfcb442f14c299f6c9679c4c0a5d6/FLAG9669d2dea [2025-02-06 03:21:46,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caeff1df4/aa3cfcb442f14c299f6c9679c4c0a5d6 [2025-02-06 03:21:46,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:21:46,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:21:46,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:46,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:21:46,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:21:46,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41db1779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46, skipping insertion in model container [2025-02-06 03:21:46,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:21:46,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2025-02-06 03:21:46,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:46,333 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:21:46,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2025-02-06 03:21:46,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:46,464 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:21:46,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46 WrapperNode [2025-02-06 03:21:46,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:46,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:46,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:21:46,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:21:46,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,578 INFO L138 Inliner]: procedures = 36, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 749 [2025-02-06 03:21:46,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:46,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:21:46,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:21:46,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:21:46,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,626 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2025-02-06 03:21:46,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:21:46,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:21:46,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:21:46,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:21:46,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (1/1) ... [2025-02-06 03:21:46,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:46,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:46,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:21:46,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:21:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:21:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:21:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:21:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:21:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:21:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:21:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:21:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:21:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:21:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:21:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:21:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:21:46,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:21:46,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:21:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:21:46,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:21:46,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:21:46,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:21:46,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:21:46,976 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:21:46,977 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:21:48,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem138#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem142#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem146#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem152#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~short158#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~short161#1;havoc property_#t~ite224#1;havoc property_#t~mem176#1;havoc property_#t~mem175#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite172#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~mem173#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~ite223#1;havoc property_#t~mem219#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~mem181#1;havoc property_#t~ite184#1;havoc property_#t~mem182#1;havoc property_#t~mem183#1;havoc property_#t~ite191#1;havoc property_#t~mem185#1;havoc property_#t~mem186#1;havoc property_#t~mem187#1;havoc property_#t~ite190#1;havoc property_#t~mem188#1;havoc property_#t~mem189#1;havoc property_#t~ite218#1;havoc property_#t~mem192#1;havoc property_#t~mem193#1;havoc property_#t~mem194#1;havoc property_#t~ite197#1;havoc property_#t~mem195#1;havoc property_#t~mem196#1;havoc property_#t~ite204#1;havoc property_#t~mem198#1;havoc property_#t~mem199#1;havoc property_#t~mem200#1;havoc property_#t~ite203#1;havoc property_#t~mem201#1;havoc property_#t~mem202#1;havoc property_#t~mem205#1;havoc property_#t~mem206#1;havoc property_#t~mem207#1;havoc property_#t~ite210#1;havoc property_#t~mem208#1;havoc property_#t~mem209#1;havoc property_#t~ite217#1;havoc property_#t~mem211#1;havoc property_#t~mem212#1;havoc property_#t~mem213#1;havoc property_#t~ite216#1;havoc property_#t~mem214#1;havoc property_#t~mem215#1;havoc property_#t~mem222#1;havoc property_#t~mem220#1;havoc property_#t~mem221#1;havoc property_#t~short225#1;havoc property_#t~mem227#1;havoc property_#t~mem226#1;havoc property_#t~short228#1; [2025-02-06 03:21:48,234 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2025-02-06 03:21:48,234 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:21:48,245 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:21:48,245 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:21:48,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:48 BoogieIcfgContainer [2025-02-06 03:21:48,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:21:48,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:21:48,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:21:48,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:21:48,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:21:46" (1/3) ... [2025-02-06 03:21:48,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41814b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:48, skipping insertion in model container [2025-02-06 03:21:48,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:46" (2/3) ... [2025-02-06 03:21:48,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41814b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:48, skipping insertion in model container [2025-02-06 03:21:48,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:48" (3/3) ... [2025-02-06 03:21:48,255 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2025-02-06 03:21:48,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:21:48,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-86.i that has 2 procedures, 154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:21:48,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:21:48,341 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;@3e3bfc78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:21:48,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:21:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 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-02-06 03:21:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:21:48,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:48,362 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] [2025-02-06 03:21:48,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:48,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1718891212, now seen corresponding path program 1 times [2025-02-06 03:21:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324353542] [2025-02-06 03:21:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:48,378 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-02-06 03:21:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:48,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 03:21:48,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:48,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:21:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:21:48,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:48,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:21:48,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:21:48,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:48,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324353542] [2025-02-06 03:21:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324353542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:21:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381378309] [2025-02-06 03:21:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:48,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:21:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:48,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:21:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:21:48,953 INFO L87 Difference]: Start difference. First operand has 154 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 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 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-02-06 03:21:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:48,982 INFO L93 Difference]: Finished difference Result 302 states and 480 transitions. [2025-02-06 03:21:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:21:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 184 [2025-02-06 03:21:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:48,989 INFO L225 Difference]: With dead ends: 302 [2025-02-06 03:21:48,990 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 03:21:48,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-02-06 03:21:48,996 INFO L435 NwaCegarLoop]: 225 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, 225 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-02-06 03:21:48,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 03:21:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-06 03:21:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 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-02-06 03:21:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-02-06 03:21:49,039 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 184 [2025-02-06 03:21:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:49,040 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-02-06 03:21:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-02-06 03:21:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-02-06 03:21:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:21:49,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:49,046 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] [2025-02-06 03:21:49,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:49,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 03:21:49,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1065674947, now seen corresponding path program 1 times [2025-02-06 03:21:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434164453] [2025-02-06 03:21:49,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:49,249 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-02-06 03:21:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:49,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 03:21:49,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:21:49,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:21:49,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:49,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:49,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:21:49,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:49,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:49,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434164453] [2025-02-06 03:21:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434164453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:49,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328121771] [2025-02-06 03:21:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:49,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:49,854 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:49,957 INFO L93 Difference]: Finished difference Result 304 states and 454 transitions. [2025-02-06 03:21:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:49,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2025-02-06 03:21:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:49,964 INFO L225 Difference]: With dead ends: 304 [2025-02-06 03:21:49,965 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 03:21:49,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:49,969 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:49,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 867 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 03:21:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-02-06 03:21:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 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-02-06 03:21:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2025-02-06 03:21:49,988 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 184 [2025-02-06 03:21:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:49,993 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2025-02-06 03:21:49,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2025-02-06 03:21:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:21:49,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:49,996 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] [2025-02-06 03:21:50,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 03:21:50,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:50,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1064751426, now seen corresponding path program 1 times [2025-02-06 03:21:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946206691] [2025-02-06 03:21:50,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:50,200 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-02-06 03:21:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:50,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 03:21:50,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:50,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:21:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:21:50,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:50,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:50,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:21:50,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2025-02-06 03:21:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-02-06 03:21:50,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:50,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946206691] [2025-02-06 03:21:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946206691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667445260] [2025-02-06 03:21:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:50,904 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 03:21:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:51,912 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2025-02-06 03:21:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 184 [2025-02-06 03:21:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:51,922 INFO L225 Difference]: With dead ends: 308 [2025-02-06 03:21:51,922 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 03:21:51,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:51,923 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 205 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:51,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 780 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:21:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 03:21:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-02-06 03:21:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 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-02-06 03:21:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2025-02-06 03:21:51,938 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 184 [2025-02-06 03:21:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:51,938 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2025-02-06 03:21:51,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 03:21:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2025-02-06 03:21:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 03:21:51,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:51,944 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] [2025-02-06 03:21:51,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 03:21:52,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1171624060, now seen corresponding path program 1 times [2025-02-06 03:21:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025866820] [2025-02-06 03:21:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:52,147 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-02-06 03:21:52,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:52,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-06 03:21:52,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:21:52,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:21:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:21:52,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:52,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:52,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:21:52,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:52,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 03:21:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 03:21:52,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:52,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:52,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025866820] [2025-02-06 03:21:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025866820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986077231] [2025-02-06 03:21:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:52,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:52,742 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 03:21:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:53,779 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2025-02-06 03:21:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 186 [2025-02-06 03:21:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:53,790 INFO L225 Difference]: With dead ends: 308 [2025-02-06 03:21:53,790 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 03:21:53,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:53,791 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 195 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:53,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 776 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:21:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 03:21:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-02-06 03:21:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.3828125) internal successors, (177), 128 states have internal predecessors, (177), 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-02-06 03:21:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 227 transitions. [2025-02-06 03:21:53,810 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 227 transitions. Word has length 186 [2025-02-06 03:21:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:53,810 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 227 transitions. [2025-02-06 03:21:53,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-02-06 03:21:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 227 transitions. [2025-02-06 03:21:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 03:21:53,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:53,813 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] [2025-02-06 03:21:53,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:21:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-06 03:21:54,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1794122306, now seen corresponding path program 1 times [2025-02-06 03:21:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:54,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157742443] [2025-02-06 03:21:54,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:54,016 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-02-06 03:21:54,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:54,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-06 03:21:54,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:21:54,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 03:21:54,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 03:21:54,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:54,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:54,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:21:54,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 03:21:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-02-06 03:21:54,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:54,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157742443] [2025-02-06 03:21:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157742443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863847546] [2025-02-06 03:21:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:54,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:54,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:54,609 INFO L87 Difference]: Start difference. First operand 155 states and 227 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-06 03:21:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:55,486 INFO L93 Difference]: Finished difference Result 308 states and 452 transitions. [2025-02-06 03:21:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 188 [2025-02-06 03:21:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:55,496 INFO L225 Difference]: With dead ends: 308 [2025-02-06 03:21:55,496 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 03:21:55,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:55,497 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 186 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:55,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 771 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:21:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 03:21:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-02-06 03:21:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 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-02-06 03:21:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-02-06 03:21:55,511 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 188 [2025-02-06 03:21:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-02-06 03:21:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-06 03:21:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-02-06 03:21:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:55,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:55,513 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-02-06 03:21:55,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:21:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-02-06 03:21:55,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:55,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 564699516, now seen corresponding path program 1 times [2025-02-06 03:21:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514642287] [2025-02-06 03:21:55,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:21:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:55,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-02-06 03:21:55,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:21:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:56,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:56,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:56,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:56,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:21:56,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:56,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:21:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-02-06 03:21:56,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:56,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:21:57,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2025-02-06 03:21:57,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:57,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 44 [2025-02-06 03:21:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 42 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-02-06 03:21:57,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:57,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514642287] [2025-02-06 03:21:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514642287] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:57,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:57,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2025-02-06 03:21:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251000024] [2025-02-06 03:21:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:57,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:57,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:57,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:21:57,965 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:58,687 INFO L93 Difference]: Finished difference Result 464 states and 674 transitions. [2025-02-06 03:21:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2025-02-06 03:21:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:58,690 INFO L225 Difference]: With dead ends: 464 [2025-02-06 03:21:58,690 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 03:21:58,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:21:58,691 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 460 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:58,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1173 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:21:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 03:21:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2025-02-06 03:21:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 234 states have internal predecessors, (327), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 395 transitions. [2025-02-06 03:21:58,713 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 395 transitions. Word has length 190 [2025-02-06 03:21:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 395 transitions. [2025-02-06 03:21:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:21:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 395 transitions. [2025-02-06 03:21:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 03:21:58,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:58,716 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, 1, 1] [2025-02-06 03:21:58,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:21:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-02-06 03:21:58,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:58,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash -324744326, now seen corresponding path program 1 times [2025-02-06 03:21:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041706042] [2025-02-06 03:21:58,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:58,923 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-02-06 03:21:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:58,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-06 03:21:58,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:21:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 03:21:59,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 03:21:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:59,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:21:59,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-02-06 03:21:59,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:21:59,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041706042] [2025-02-06 03:21:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041706042] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:59,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:21:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611961907] [2025-02-06 03:21:59,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:59,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:59,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:59,951 INFO L87 Difference]: Start difference. First operand 270 states and 395 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:00,081 INFO L93 Difference]: Finished difference Result 548 states and 795 transitions. [2025-02-06 03:22:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:22:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-02-06 03:22:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:00,085 INFO L225 Difference]: With dead ends: 548 [2025-02-06 03:22:00,086 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:22:00,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:00,087 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 111 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:00,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1003 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:22:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-02-06 03:22:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 237 states have (on average 1.3755274261603376) internal successors, (326), 239 states have internal predecessors, (326), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:22:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 398 transitions. [2025-02-06 03:22:00,102 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 398 transitions. Word has length 192 [2025-02-06 03:22:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:00,102 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 398 transitions. [2025-02-06 03:22:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2025-02-06 03:22:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 03:22:00,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:00,104 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, 1, 1] [2025-02-06 03:22:00,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:22:00,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-02-06 03:22:00,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:00,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1182807483, now seen corresponding path program 1 times [2025-02-06 03:22:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426062341] [2025-02-06 03:22:00,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:00,306 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-02-06 03:22:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:00,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-02-06 03:22:00,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:22:00,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 03:22:00,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 03:22:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:00,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:22:00,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-02-06 03:22:01,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:22:01,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:01,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426062341] [2025-02-06 03:22:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426062341] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:22:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106055886] [2025-02-06 03:22:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:22:01,336 INFO L87 Difference]: Start difference. First operand 278 states and 398 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:01,456 INFO L93 Difference]: Finished difference Result 547 states and 785 transitions. [2025-02-06 03:22:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:01,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-02-06 03:22:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:01,459 INFO L225 Difference]: With dead ends: 547 [2025-02-06 03:22:01,459 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:22:01,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:01,460 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 208 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:01,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 821 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:22:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-02-06 03:22:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 237 states have (on average 1.371308016877637) internal successors, (325), 239 states have internal predecessors, (325), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:22:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 397 transitions. [2025-02-06 03:22:01,475 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 397 transitions. Word has length 192 [2025-02-06 03:22:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:01,475 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 397 transitions. [2025-02-06 03:22:01,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2025-02-06 03:22:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 03:22:01,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:01,477 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, 1, 1] [2025-02-06 03:22:01,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:22:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-02-06 03:22:01,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:01,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 155133082, now seen corresponding path program 1 times [2025-02-06 03:22:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505983063] [2025-02-06 03:22:01,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:01,679 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-02-06 03:22:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:01,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-02-06 03:22:01,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:22:01,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 03:22:02,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 03:22:02,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:02,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:22:02,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:02,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-06 03:22:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-02-06 03:22:02,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-02-06 03:22:02,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:02,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505983063] [2025-02-06 03:22:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505983063] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:02,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-06 03:22:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092250529] [2025-02-06 03:22:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:02,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:02,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:02,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:22:02,878 INFO L87 Difference]: Start difference. First operand 278 states and 397 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:03,005 INFO L93 Difference]: Finished difference Result 545 states and 778 transitions. [2025-02-06 03:22:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-02-06 03:22:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:03,009 INFO L225 Difference]: With dead ends: 545 [2025-02-06 03:22:03,009 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:22:03,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:22:03,011 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 216 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:03,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 639 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:22:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 267. [2025-02-06 03:22:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 228 states have (on average 1.3728070175438596) internal successors, (313), 229 states have internal predecessors, (313), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:22:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 381 transitions. [2025-02-06 03:22:03,033 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 381 transitions. Word has length 192 [2025-02-06 03:22:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 381 transitions. [2025-02-06 03:22:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-02-06 03:22:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 381 transitions. [2025-02-06 03:22:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 03:22:03,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:03,038 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, 1, 1] [2025-02-06 03:22:03,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/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-02-06 03:22:03,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 125388698, now seen corresponding path program 1 times [2025-02-06 03:22:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:03,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955099517] [2025-02-06 03:22:03,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:03,240 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-02-06 03:22:03,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:03,242 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/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-02-06 03:22:03,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:22:03,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.