./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-53.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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:23:49,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:23:49,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:23:49,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:23:49,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:23:49,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:23:49,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:23:49,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:23:49,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:23:49,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:23:49,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:23:49,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:23:49,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:23:49,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:23:49,295 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:23:49,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:23:49,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:23:49,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:23:49,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:23:49,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:49,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:49,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:49,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:23:49,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:23:49,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:23:49,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:23:49,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:23:49,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:23:49,300 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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2025-01-09 15:23:49,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:23:49,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:23:49,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:23:49,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:23:49,519 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:23:49,520 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-53.i [2025-01-09 15:23:50,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9611c262/b048be1d740e4964a3b031b7518d18d9/FLAGc7d316e25 [2025-01-09 15:23:50,936 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:23:50,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2025-01-09 15:23:50,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9611c262/b048be1d740e4964a3b031b7518d18d9/FLAGc7d316e25 [2025-01-09 15:23:51,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9611c262/b048be1d740e4964a3b031b7518d18d9 [2025-01-09 15:23:51,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:23:51,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:23:51,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:51,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:23:51,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:23:51,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721f17ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51, skipping insertion in model container [2025-01-09 15:23:51,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:23:51,352 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-53.i[916,929] [2025-01-09 15:23:51,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:51,427 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:23:51,434 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-53.i[916,929] [2025-01-09 15:23:51,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:23:51,479 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:23:51,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51 WrapperNode [2025-01-09 15:23:51,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:23:51,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:51,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:23:51,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:23:51,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,530 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-01-09 15:23:51,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:23:51,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:23:51,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:23:51,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:23:51,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,570 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2025-01-09 15:23:51,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:23:51,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:23:51,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:23:51,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:23:51,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (1/1) ... [2025-01-09 15:23:51,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:23:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:51,626 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-01-09 15:23:51,634 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-01-09 15:23:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:23:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:23:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:23:51,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:23:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:23:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:23:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:23:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:23:51,766 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:23:51,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:23:52,121 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 15:23:52,121 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:23:52,133 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:23:52,134 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:23:52,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52 BoogieIcfgContainer [2025-01-09 15:23:52,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:23:52,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:23:52,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:23:52,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:23:52,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:23:51" (1/3) ... [2025-01-09 15:23:52,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fdd2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:52, skipping insertion in model container [2025-01-09 15:23:52,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:23:51" (2/3) ... [2025-01-09 15:23:52,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fdd2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:23:52, skipping insertion in model container [2025-01-09 15:23:52,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52" (3/3) ... [2025-01-09 15:23:52,142 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2025-01-09 15:23:52,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:23:52,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:23:52,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:23:52,212 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;@18ff0c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:23:52,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:23:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:23:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:23:52,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:52,223 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:52,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1655323305, now seen corresponding path program 1 times [2025-01-09 15:23:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232326654] [2025-01-09 15:23:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:23:52,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:23:52,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:52,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:23:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232326654] [2025-01-09 15:23:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232326654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:23:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8198650] [2025-01-09 15:23:52,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:23:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:23:52,496 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-01-09 15:23:52,498 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-01-09 15:23:52,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:23:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:23:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:52,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:23:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:23:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:23:52,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:23:52,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8198650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:23:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:23:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311940975] [2025-01-09 15:23:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:23:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:52,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:23:52,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:23:52,782 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:52,805 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-01-09 15:23:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:23:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-01-09 15:23:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:52,811 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:23:52,811 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:23:52,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-01-09 15:23:52,816 INFO L435 NwaCegarLoop]: 155 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, 155 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-01-09 15:23:52,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:23:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:23:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:23:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-01-09 15:23:52,855 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-01-09 15:23:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-01-09 15:23:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-01-09 15:23:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:23:52,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:52,861 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:52,869 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-01-09 15:23:53,062 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-01-09 15:23:53,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1073682249, now seen corresponding path program 1 times [2025-01-09 15:23:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139863819] [2025-01-09 15:23:53,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:23:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:23:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:23:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139863819] [2025-01-09 15:23:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139863819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:23:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940256654] [2025-01-09 15:23:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:54,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:23:54,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:54,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:23:54,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:23:54,842 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:55,012 INFO L93 Difference]: Finished difference Result 215 states and 310 transitions. [2025-01-09 15:23:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-01-09 15:23:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:55,015 INFO L225 Difference]: With dead ends: 215 [2025-01-09 15:23:55,015 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:23:55,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:55,016 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:55,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 576 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:23:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:23:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:23:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2025-01-09 15:23:55,024 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 140 [2025-01-09 15:23:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2025-01-09 15:23:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2025-01-09 15:23:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:23:55,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:55,027 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:55,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:23:55,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -372617671, now seen corresponding path program 1 times [2025-01-09 15:23:55,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:55,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813754435] [2025-01-09 15:23:55,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:23:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:23:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:23:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:56,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813754435] [2025-01-09 15:23:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813754435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:56,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:23:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899896702] [2025-01-09 15:23:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:56,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:23:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:56,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:23:56,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:56,157 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:56,515 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2025-01-09 15:23:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:23:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-01-09 15:23:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:56,518 INFO L225 Difference]: With dead ends: 362 [2025-01-09 15:23:56,518 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 15:23:56,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:23:56,519 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 208 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:56,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 862 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:23:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 15:23:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 250. [2025-01-09 15:23:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 199 states have internal predecessors, (264), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:23:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 360 transitions. [2025-01-09 15:23:56,545 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 360 transitions. Word has length 140 [2025-01-09 15:23:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 360 transitions. [2025-01-09 15:23:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:23:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 360 transitions. [2025-01-09 15:23:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:23:56,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:56,547 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:23:56,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1027255328, now seen corresponding path program 1 times [2025-01-09 15:23:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106271315] [2025-01-09 15:23:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:56,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:23:56,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:23:56,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:23:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106271315] [2025-01-09 15:23:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106271315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:23:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297917691] [2025-01-09 15:23:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:23:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:57,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:23:57,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:23:57,848 INFO L87 Difference]: Start difference. First operand 250 states and 360 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:23:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:58,331 INFO L93 Difference]: Finished difference Result 360 states and 515 transitions. [2025-01-09 15:23:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:23:58,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 142 [2025-01-09 15:23:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:58,333 INFO L225 Difference]: With dead ends: 360 [2025-01-09 15:23:58,333 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 15:23:58,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:23:58,334 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 195 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:58,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1070 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:23:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 15:23:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2025-01-09 15:23:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.321608040201005) internal successors, (263), 200 states have internal predecessors, (263), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:23:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2025-01-09 15:23:58,379 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 142 [2025-01-09 15:23:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:58,381 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2025-01-09 15:23:58,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:23:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2025-01-09 15:23:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:23:58,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:58,384 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:23:58,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:58,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1178404342, now seen corresponding path program 1 times [2025-01-09 15:23:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166313927] [2025-01-09 15:23:58,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:23:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:23:58,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:58,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:23:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166313927] [2025-01-09 15:23:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166313927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:58,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:58,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:23:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444537074] [2025-01-09 15:23:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:58,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:23:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:58,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:23:58,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:23:58,526 INFO L87 Difference]: Start difference. First operand 252 states and 359 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:23:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:58,577 INFO L93 Difference]: Finished difference Result 466 states and 662 transitions. [2025-01-09 15:23:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:23:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:23:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:58,581 INFO L225 Difference]: With dead ends: 466 [2025-01-09 15:23:58,581 INFO L226 Difference]: Without dead ends: 252 [2025-01-09 15:23:58,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:23:58,584 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:58,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:23:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-01-09 15:23:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-01-09 15:23:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.3115577889447236) internal successors, (261), 200 states have internal predecessors, (261), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:23:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 357 transitions. [2025-01-09 15:23:58,617 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 357 transitions. Word has length 145 [2025-01-09 15:23:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:58,618 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 357 transitions. [2025-01-09 15:23:58,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:23:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 357 transitions. [2025-01-09 15:23:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:23:58,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:58,619 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:58,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:23:58,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:58,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1765210356, now seen corresponding path program 1 times [2025-01-09 15:23:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206565993] [2025-01-09 15:23:58,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:58,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:23:58,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:23:58,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:58,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:23:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:23:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:23:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206565993] [2025-01-09 15:23:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206565993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:23:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:23:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:23:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619738743] [2025-01-09 15:23:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:23:59,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:23:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:23:59,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:23:59,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:23:59,423 INFO L87 Difference]: Start difference. First operand 252 states and 357 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:23:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:23:59,641 INFO L93 Difference]: Finished difference Result 560 states and 779 transitions. [2025-01-09 15:23:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:23:59,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-01-09 15:23:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:23:59,645 INFO L225 Difference]: With dead ends: 560 [2025-01-09 15:23:59,645 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 15:23:59,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:23:59,646 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 51 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:23:59,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1016 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:23:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 15:23:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2025-01-09 15:23:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 283 states have (on average 1.303886925795053) internal successors, (369), 286 states have internal predecessors, (369), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:23:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 473 transitions. [2025-01-09 15:23:59,680 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 473 transitions. Word has length 145 [2025-01-09 15:23:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:23:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 473 transitions. [2025-01-09 15:23:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:23:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 473 transitions. [2025-01-09 15:23:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:23:59,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:23:59,682 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:23:59,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:23:59,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:23:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:23:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1835344023, now seen corresponding path program 1 times [2025-01-09 15:23:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:23:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114420456] [2025-01-09 15:23:59,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:23:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:23:59,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:23:59,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:23:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:23:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114420456] [2025-01-09 15:24:00,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114420456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:00,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:00,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360577073] [2025-01-09 15:24:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:00,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:00,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:00,447 INFO L87 Difference]: Start difference. First operand 342 states and 473 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:00,941 INFO L93 Difference]: Finished difference Result 736 states and 1012 transitions. [2025-01-09 15:24:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:24:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-01-09 15:24:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:00,944 INFO L225 Difference]: With dead ends: 736 [2025-01-09 15:24:00,944 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 15:24:00,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:00,946 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 204 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:00,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1007 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:24:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 15:24:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 321. [2025-01-09 15:24:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 274 states have (on average 1.313868613138686) internal successors, (360), 276 states have internal predecessors, (360), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:24:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 440 transitions. [2025-01-09 15:24:00,978 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 440 transitions. Word has length 146 [2025-01-09 15:24:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:00,978 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 440 transitions. [2025-01-09 15:24:00,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 440 transitions. [2025-01-09 15:24:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:24:00,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:00,979 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:24:00,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:00,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1758558695, now seen corresponding path program 1 times [2025-01-09 15:24:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740222051] [2025-01-09 15:24:00,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:00,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:24:01,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:24:01,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:01,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740222051] [2025-01-09 15:24:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740222051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304713402] [2025-01-09 15:24:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:01,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:01,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:01,632 INFO L87 Difference]: Start difference. First operand 321 states and 440 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:02,130 INFO L93 Difference]: Finished difference Result 755 states and 1031 transitions. [2025-01-09 15:24:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:24:02,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-01-09 15:24:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:02,133 INFO L225 Difference]: With dead ends: 755 [2025-01-09 15:24:02,133 INFO L226 Difference]: Without dead ends: 437 [2025-01-09 15:24:02,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:02,134 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 203 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:02,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 891 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:24:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-09 15:24:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 328. [2025-01-09 15:24:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 281 states have (on average 1.302491103202847) internal successors, (366), 283 states have internal predecessors, (366), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:24:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 446 transitions. [2025-01-09 15:24:02,175 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 446 transitions. Word has length 146 [2025-01-09 15:24:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:02,177 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 446 transitions. [2025-01-09 15:24:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 446 transitions. [2025-01-09 15:24:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:24:02,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:02,179 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:02,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:24:02,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:02,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1017695573, now seen corresponding path program 1 times [2025-01-09 15:24:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770570374] [2025-01-09 15:24:02,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:02,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:24:02,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:24:02,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:02,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770570374] [2025-01-09 15:24:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770570374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:02,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:24:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807654070] [2025-01-09 15:24:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:02,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:24:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:02,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:24:02,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:02,624 INFO L87 Difference]: Start difference. First operand 328 states and 446 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:02,901 INFO L93 Difference]: Finished difference Result 882 states and 1203 transitions. [2025-01-09 15:24:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:24:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-01-09 15:24:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:02,905 INFO L225 Difference]: With dead ends: 882 [2025-01-09 15:24:02,905 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 15:24:02,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:02,906 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 103 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:02,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1336 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 15:24:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 348. [2025-01-09 15:24:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.2923588039867109) internal successors, (389), 303 states have internal predecessors, (389), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:24:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 469 transitions. [2025-01-09 15:24:02,970 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 469 transitions. Word has length 146 [2025-01-09 15:24:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 469 transitions. [2025-01-09 15:24:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 469 transitions. [2025-01-09 15:24:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:24:02,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:02,971 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:24:02,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1718760151, now seen corresponding path program 1 times [2025-01-09 15:24:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795762168] [2025-01-09 15:24:02,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:03,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:24:03,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:24:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795762168] [2025-01-09 15:24:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795762168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:03,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:24:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715020952] [2025-01-09 15:24:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:03,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:24:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:03,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:24:03,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:03,764 INFO L87 Difference]: Start difference. First operand 348 states and 469 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:04,566 INFO L93 Difference]: Finished difference Result 812 states and 1100 transitions. [2025-01-09 15:24:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:24:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-01-09 15:24:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:04,569 INFO L225 Difference]: With dead ends: 812 [2025-01-09 15:24:04,569 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 15:24:04,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:24:04,570 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 308 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:04,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1311 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:24:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 15:24:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 420. [2025-01-09 15:24:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 357 states have (on average 1.288515406162465) internal successors, (460), 360 states have internal predecessors, (460), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:24:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 568 transitions. [2025-01-09 15:24:04,611 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 568 transitions. Word has length 146 [2025-01-09 15:24:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 568 transitions. [2025-01-09 15:24:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 568 transitions. [2025-01-09 15:24:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:24:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:04,616 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:04,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:24:04,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:04,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1884670718, now seen corresponding path program 1 times [2025-01-09 15:24:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202597547] [2025-01-09 15:24:04,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:24:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:24:04,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:04,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:04,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202597547] [2025-01-09 15:24:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202597547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444821031] [2025-01-09 15:24:04,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:04,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:04,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:04,752 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-01-09 15:24:04,757 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-01-09 15:24:04,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:24:04,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:24:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:04,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:24:04,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:04,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444821031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:24:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511584724] [2025-01-09 15:24:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:24:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:04,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:24:04,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:04,957 INFO L87 Difference]: Start difference. First operand 420 states and 568 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:05,014 INFO L93 Difference]: Finished difference Result 852 states and 1153 transitions. [2025-01-09 15:24:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:24:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:24:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:05,017 INFO L225 Difference]: With dead ends: 852 [2025-01-09 15:24:05,017 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 15:24:05,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:05,019 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:05,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 15:24:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-01-09 15:24:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 372 states have (on average 1.2768817204301075) internal successors, (475), 375 states have internal predecessors, (475), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:24:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 583 transitions. [2025-01-09 15:24:05,060 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 583 transitions. Word has length 147 [2025-01-09 15:24:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:05,060 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 583 transitions. [2025-01-09 15:24:05,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 583 transitions. [2025-01-09 15:24:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:24:05,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:05,062 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:05,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:05,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:05,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:05,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1348961080, now seen corresponding path program 1 times [2025-01-09 15:24:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038170068] [2025-01-09 15:24:05,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:24:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:24:05,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:05,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:05,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038170068] [2025-01-09 15:24:05,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038170068] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:05,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719777283] [2025-01-09 15:24:05,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:05,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:05,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:05,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:05,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:24:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:24:05,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:24:05,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:05,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:05,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:24:05,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:05,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719777283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:24:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998167302] [2025-01-09 15:24:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:24:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:24:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:05,688 INFO L87 Difference]: Start difference. First operand 435 states and 583 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:05,751 INFO L93 Difference]: Finished difference Result 887 states and 1188 transitions. [2025-01-09 15:24:05,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:24:05,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:24:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:05,754 INFO L225 Difference]: With dead ends: 887 [2025-01-09 15:24:05,754 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 15:24:05,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:05,755 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:05,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 15:24:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 449. [2025-01-09 15:24:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 386 states have (on average 1.266839378238342) internal successors, (489), 389 states have internal predecessors, (489), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:24:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 597 transitions. [2025-01-09 15:24:05,793 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 597 transitions. Word has length 147 [2025-01-09 15:24:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:05,793 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 597 transitions. [2025-01-09 15:24:05,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 597 transitions. [2025-01-09 15:24:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:24:05,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:05,795 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:05,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:05,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash -870632130, now seen corresponding path program 1 times [2025-01-09 15:24:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765446481] [2025-01-09 15:24:06,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:24:06,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:24:06,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:06,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765446481] [2025-01-09 15:24:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765446481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:06,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091771841] [2025-01-09 15:24:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:06,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:06,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:06,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:06,695 INFO L87 Difference]: Start difference. First operand 449 states and 597 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:07,216 INFO L93 Difference]: Finished difference Result 785 states and 1054 transitions. [2025-01-09 15:24:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-01-09 15:24:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:07,220 INFO L225 Difference]: With dead ends: 785 [2025-01-09 15:24:07,220 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 15:24:07,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:07,221 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 109 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:07,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1045 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:24:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 15:24:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 484. [2025-01-09 15:24:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 410 states have (on average 1.2658536585365854) internal successors, (519), 413 states have internal predecessors, (519), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:24:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 647 transitions. [2025-01-09 15:24:07,266 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 647 transitions. Word has length 148 [2025-01-09 15:24:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:07,267 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 647 transitions. [2025-01-09 15:24:07,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 647 transitions. [2025-01-09 15:24:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:24:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:07,268 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:24:07,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash -169567552, now seen corresponding path program 1 times [2025-01-09 15:24:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420916163] [2025-01-09 15:24:07,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:07,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:24:07,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:24:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:07,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420916163] [2025-01-09 15:24:07,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420916163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:07,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:24:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377403915] [2025-01-09 15:24:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:07,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:07,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:07,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:24:07,626 INFO L87 Difference]: Start difference. First operand 484 states and 647 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:07,860 INFO L93 Difference]: Finished difference Result 903 states and 1209 transitions. [2025-01-09 15:24:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-01-09 15:24:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:07,863 INFO L225 Difference]: With dead ends: 903 [2025-01-09 15:24:07,864 INFO L226 Difference]: Without dead ends: 717 [2025-01-09 15:24:07,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:24:07,865 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 105 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:07,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 745 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-09 15:24:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 484. [2025-01-09 15:24:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 410 states have (on average 1.2609756097560976) internal successors, (517), 413 states have internal predecessors, (517), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 15:24:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 645 transitions. [2025-01-09 15:24:07,908 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 645 transitions. Word has length 148 [2025-01-09 15:24:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:07,909 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 645 transitions. [2025-01-09 15:24:07,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 645 transitions. [2025-01-09 15:24:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:24:07,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:07,910 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:24:07,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:07,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -987216002, now seen corresponding path program 1 times [2025-01-09 15:24:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285791227] [2025-01-09 15:24:07,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:07,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:24:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:24:07,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:07,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285791227] [2025-01-09 15:24:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285791227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966605059] [2025-01-09 15:24:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:08,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:08,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:08,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:08,476 INFO L87 Difference]: Start difference. First operand 484 states and 645 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:08,982 INFO L93 Difference]: Finished difference Result 753 states and 1000 transitions. [2025-01-09 15:24:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-01-09 15:24:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:08,986 INFO L225 Difference]: With dead ends: 753 [2025-01-09 15:24:08,986 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 15:24:08,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:08,987 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 110 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:08,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1144 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:24:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 15:24:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2025-01-09 15:24:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 473 states have (on average 1.2579281183932347) internal successors, (595), 477 states have internal predecessors, (595), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:24:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 751 transitions. [2025-01-09 15:24:09,048 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 751 transitions. Word has length 148 [2025-01-09 15:24:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:09,049 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 751 transitions. [2025-01-09 15:24:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 751 transitions. [2025-01-09 15:24:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:24:09,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:09,051 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:24:09,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1237048121, now seen corresponding path program 1 times [2025-01-09 15:24:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:09,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712382505] [2025-01-09 15:24:09,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:09,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:24:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:24:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:10,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712382505] [2025-01-09 15:24:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712382505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:10,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430559641] [2025-01-09 15:24:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:10,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:10,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:10,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:10,034 INFO L87 Difference]: Start difference. First operand 563 states and 751 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:10,333 INFO L93 Difference]: Finished difference Result 936 states and 1220 transitions. [2025-01-09 15:24:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-01-09 15:24:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:10,338 INFO L225 Difference]: With dead ends: 936 [2025-01-09 15:24:10,339 INFO L226 Difference]: Without dead ends: 934 [2025-01-09 15:24:10,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:10,340 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 54 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:10,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1049 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-01-09 15:24:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 850. [2025-01-09 15:24:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 751 states have (on average 1.2583222370173102) internal successors, (945), 758 states have internal predecessors, (945), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:24:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1113 transitions. [2025-01-09 15:24:10,412 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1113 transitions. Word has length 149 [2025-01-09 15:24:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:10,412 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1113 transitions. [2025-01-09 15:24:10,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:24:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1113 transitions. [2025-01-09 15:24:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:24:10,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:10,414 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:10,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:24:10,415 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:10,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2115394725, now seen corresponding path program 1 times [2025-01-09 15:24:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:10,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799310878] [2025-01-09 15:24:10,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:10,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:24:10,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:24:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799310878] [2025-01-09 15:24:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799310878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119513421] [2025-01-09 15:24:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:11,073 INFO L87 Difference]: Start difference. First operand 850 states and 1113 transitions. Second operand has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:24:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:11,390 INFO L93 Difference]: Finished difference Result 2047 states and 2687 transitions. [2025-01-09 15:24:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:11,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2025-01-09 15:24:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:11,394 INFO L225 Difference]: With dead ends: 2047 [2025-01-09 15:24:11,395 INFO L226 Difference]: Without dead ends: 1200 [2025-01-09 15:24:11,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:11,398 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 93 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:11,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1160 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-01-09 15:24:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1183. [2025-01-09 15:24:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1054 states have (on average 1.26280834914611) internal successors, (1331), 1066 states have internal predecessors, (1331), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:24:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1547 transitions. [2025-01-09 15:24:11,495 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1547 transitions. Word has length 149 [2025-01-09 15:24:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:11,496 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1547 transitions. [2025-01-09 15:24:11,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:24:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1547 transitions. [2025-01-09 15:24:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:24:11,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:11,497 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:11,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:24:11,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash -210110125, now seen corresponding path program 1 times [2025-01-09 15:24:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301382062] [2025-01-09 15:24:11,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:11,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:24:11,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:24:11,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:11,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:11,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301382062] [2025-01-09 15:24:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301382062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:11,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854020888] [2025-01-09 15:24:11,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:11,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:24:11,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:24:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:24:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:24:11,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:11,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854020888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:11,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:24:11,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-01-09 15:24:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479072396] [2025-01-09 15:24:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:11,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:24:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:11,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:24:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:11,857 INFO L87 Difference]: Start difference. First operand 1183 states and 1547 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:12,028 INFO L93 Difference]: Finished difference Result 2434 states and 3164 transitions. [2025-01-09 15:24:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:24:12,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-01-09 15:24:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:12,033 INFO L225 Difference]: With dead ends: 2434 [2025-01-09 15:24:12,033 INFO L226 Difference]: Without dead ends: 1281 [2025-01-09 15:24:12,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:24:12,035 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:12,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 871 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-01-09 15:24:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1199. [2025-01-09 15:24:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1070 states have (on average 1.2588785046728972) internal successors, (1347), 1082 states have internal predecessors, (1347), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:24:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1563 transitions. [2025-01-09 15:24:12,204 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1563 transitions. Word has length 149 [2025-01-09 15:24:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:12,204 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1563 transitions. [2025-01-09 15:24:12,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:24:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1563 transitions. [2025-01-09 15:24:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:12,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:12,207 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:12,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:24:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 15:24:12,408 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:12,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 620999326, now seen corresponding path program 1 times [2025-01-09 15:24:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318020216] [2025-01-09 15:24:12,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:12,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:12,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:12,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:12,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318020216] [2025-01-09 15:24:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318020216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:24:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717026299] [2025-01-09 15:24:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:12,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:24:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:12,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:24:12,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:24:12,850 INFO L87 Difference]: Start difference. First operand 1199 states and 1563 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:13,194 INFO L93 Difference]: Finished difference Result 1976 states and 2571 transitions. [2025-01-09 15:24:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:24:13,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-01-09 15:24:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:13,199 INFO L225 Difference]: With dead ends: 1976 [2025-01-09 15:24:13,199 INFO L226 Difference]: Without dead ends: 1256 [2025-01-09 15:24:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:24:13,201 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 121 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1964 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:24:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-01-09 15:24:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1238. [2025-01-09 15:24:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1091 states have (on average 1.2538955087076078) internal successors, (1368), 1103 states have internal predecessors, (1368), 122 states have call successors, (122), 24 states have call predecessors, (122), 24 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 15:24:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1612 transitions. [2025-01-09 15:24:13,304 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1612 transitions. Word has length 151 [2025-01-09 15:24:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1612 transitions. [2025-01-09 15:24:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1612 transitions. [2025-01-09 15:24:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:13,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:13,306 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:13,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:24:13,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1375408275, now seen corresponding path program 1 times [2025-01-09 15:24:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392182375] [2025-01-09 15:24:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:13,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:13,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:13,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392182375] [2025-01-09 15:24:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392182375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168180304] [2025-01-09 15:24:13,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:13,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:13,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:24:14,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:14,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:14,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:14,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:14,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 15:24:14,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:14,254 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-01-09 15:24:14,417 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 44 treesize of output 22 [2025-01-09 15:24:14,501 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 27 treesize of output 11 [2025-01-09 15:24:14,611 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 44 treesize of output 22 [2025-01-09 15:24:14,700 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 34 treesize of output 16 [2025-01-09 15:24:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 15:24:14,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-01-09 15:24:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168180304] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:24:15,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:24:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 26 [2025-01-09 15:24:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41613246] [2025-01-09 15:24:15,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:24:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:24:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:15,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:24:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:24:15,044 INFO L87 Difference]: Start difference. First operand 1238 states and 1612 transitions. Second operand has 26 states, 21 states have (on average 7.190476190476191) internal successors, (151), 26 states have internal predecessors, (151), 10 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 10 states have call successors, (54) [2025-01-09 15:24:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:16,325 INFO L93 Difference]: Finished difference Result 2873 states and 3714 transitions. [2025-01-09 15:24:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 15:24:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 7.190476190476191) internal successors, (151), 26 states have internal predecessors, (151), 10 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 10 states have call successors, (54) Word has length 151 [2025-01-09 15:24:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:16,332 INFO L225 Difference]: With dead ends: 2873 [2025-01-09 15:24:16,332 INFO L226 Difference]: Without dead ends: 1665 [2025-01-09 15:24:16,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1410, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:24:16,335 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 557 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:16,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1471 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:24:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-01-09 15:24:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1258. [2025-01-09 15:24:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1108 states have (on average 1.2554151624548737) internal successors, (1391), 1120 states have internal predecessors, (1391), 120 states have call successors, (120), 29 states have call predecessors, (120), 29 states have return successors, (120), 108 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 15:24:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1631 transitions. [2025-01-09 15:24:16,455 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1631 transitions. Word has length 151 [2025-01-09 15:24:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:16,455 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1631 transitions. [2025-01-09 15:24:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 7.190476190476191) internal successors, (151), 26 states have internal predecessors, (151), 10 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 10 states have call successors, (54) [2025-01-09 15:24:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1631 transitions. [2025-01-09 15:24:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:24:16,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:16,457 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:16,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 15:24:16,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:16,657 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash -72391017, now seen corresponding path program 1 times [2025-01-09 15:24:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387898397] [2025-01-09 15:24:16,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:16,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:16,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:16,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:16,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387898397] [2025-01-09 15:24:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387898397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068729758] [2025-01-09 15:24:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:17,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:17,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 15:24:17,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:24:17,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:24:17,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:17,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 15:24:17,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:17,736 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 9 treesize of output 3 [2025-01-09 15:24:17,908 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 27 treesize of output 11 [2025-01-09 15:24:17,965 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-01-09 15:24:18,013 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 23 treesize of output 11 [2025-01-09 15:24:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 15:24:18,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:18,229 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 30 treesize of output 18 [2025-01-09 15:24:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068729758] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:24:18,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:24:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-01-09 15:24:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361685477] [2025-01-09 15:24:18,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:24:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:24:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:24:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:24:18,269 INFO L87 Difference]: Start difference. First operand 1258 states and 1631 transitions. Second operand has 21 states, 18 states have (on average 7.666666666666667) internal successors, (138), 21 states have internal predecessors, (138), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) [2025-01-09 15:24:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:19,299 INFO L93 Difference]: Finished difference Result 2786 states and 3588 transitions. [2025-01-09 15:24:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 15:24:19,299 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.666666666666667) internal successors, (138), 21 states have internal predecessors, (138), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) Word has length 151 [2025-01-09 15:24:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:19,306 INFO L225 Difference]: With dead ends: 2786 [2025-01-09 15:24:19,306 INFO L226 Difference]: Without dead ends: 1558 [2025-01-09 15:24:19,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:24:19,318 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 400 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:19,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1412 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:24:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-01-09 15:24:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1351. [2025-01-09 15:24:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1189 states have (on average 1.2514718250630783) internal successors, (1488), 1202 states have internal predecessors, (1488), 128 states have call successors, (128), 33 states have call predecessors, (128), 33 states have return successors, (128), 115 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 15:24:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1744 transitions. [2025-01-09 15:24:19,462 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1744 transitions. Word has length 151 [2025-01-09 15:24:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:19,462 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1744 transitions. [2025-01-09 15:24:19,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.666666666666667) internal successors, (138), 21 states have internal predecessors, (138), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) [2025-01-09 15:24:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1744 transitions. [2025-01-09 15:24:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:24:19,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:19,463 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:19,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 15:24:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 15:24:19,664 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:19,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 348753484, now seen corresponding path program 1 times [2025-01-09 15:24:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391029083] [2025-01-09 15:24:19,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:19,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:24:19,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:24:19,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391029083] [2025-01-09 15:24:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391029083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994484227] [2025-01-09 15:24:20,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:20,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:20,514 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:20,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 15:24:20,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:24:20,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:24:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:20,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:24:20,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:20,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:24:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:24:20,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-01-09 15:24:20,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:20,994 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 46 treesize of output 27 [2025-01-09 15:24:21,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:21,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2025-01-09 15:24:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-01-09 15:24:21,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:24:21,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994484227] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:24:21,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:24:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 23 [2025-01-09 15:24:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933211715] [2025-01-09 15:24:21,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:24:21,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 15:24:21,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:21,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 15:24:21,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:24:21,319 INFO L87 Difference]: Start difference. First operand 1351 states and 1744 transitions. Second operand has 23 states, 18 states have (on average 8.0) internal successors, (144), 23 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) [2025-01-09 15:24:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:24,499 INFO L93 Difference]: Finished difference Result 2597 states and 3294 transitions. [2025-01-09 15:24:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 15:24:24,500 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 8.0) internal successors, (144), 23 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) Word has length 152 [2025-01-09 15:24:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:24,505 INFO L225 Difference]: With dead ends: 2597 [2025-01-09 15:24:24,505 INFO L226 Difference]: Without dead ends: 1276 [2025-01-09 15:24:24,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 302 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1242, Invalid=6590, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 15:24:24,509 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1000 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:24,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1144 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:24:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-01-09 15:24:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 956. [2025-01-09 15:24:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 817 states have (on average 1.2203182374541004) internal successors, (997), 822 states have internal predecessors, (997), 106 states have call successors, (106), 32 states have call predecessors, (106), 32 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 15:24:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1209 transitions. [2025-01-09 15:24:24,640 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1209 transitions. Word has length 152 [2025-01-09 15:24:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:24,640 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1209 transitions. [2025-01-09 15:24:24,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 8.0) internal successors, (144), 23 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) [2025-01-09 15:24:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1209 transitions. [2025-01-09 15:24:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:24:24,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:24,641 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:24,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:24,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:24,842 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 273524698, now seen corresponding path program 1 times [2025-01-09 15:24:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695572107] [2025-01-09 15:24:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:24:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:24:24,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 87 proven. 48 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 15:24:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695572107] [2025-01-09 15:24:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695572107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884731838] [2025-01-09 15:24:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:25,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:25,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:24:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 15:24:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:24:26,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:24:26,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:26,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:26,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 15:24:26,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:26,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:24:26,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-01-09 15:24:26,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:26,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2025-01-09 15:24:26,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:26,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2025-01-09 15:24:26,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:26,868 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 70 treesize of output 32 [2025-01-09 15:24:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 54 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-09 15:24:26,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884731838] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:29,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:24:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 24 [2025-01-09 15:24:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967379989] [2025-01-09 15:24:29,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:24:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 15:24:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:29,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 15:24:29,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 15:24:29,719 INFO L87 Difference]: Start difference. First operand 956 states and 1209 transitions. Second operand has 24 states, 18 states have (on average 6.444444444444445) internal successors, (116), 21 states have internal predecessors, (116), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2025-01-09 15:24:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:30,445 INFO L93 Difference]: Finished difference Result 1504 states and 1871 transitions. [2025-01-09 15:24:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 15:24:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 6.444444444444445) internal successors, (116), 21 states have internal predecessors, (116), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) Word has length 154 [2025-01-09 15:24:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:30,448 INFO L225 Difference]: With dead ends: 1504 [2025-01-09 15:24:30,448 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 15:24:30,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 15:24:30,450 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 357 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:30,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 888 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:24:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 15:24:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 328. [2025-01-09 15:24:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 274 states have (on average 1.2043795620437956) internal successors, (330), 274 states have internal predecessors, (330), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:24:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 402 transitions. [2025-01-09 15:24:30,529 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 402 transitions. Word has length 154 [2025-01-09 15:24:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 402 transitions. [2025-01-09 15:24:30,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 6.444444444444445) internal successors, (116), 21 states have internal predecessors, (116), 10 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2025-01-09 15:24:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 402 transitions. [2025-01-09 15:24:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:24:30,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:30,531 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:30,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:24:30,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:24:30,735 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1842456495, now seen corresponding path program 1 times [2025-01-09 15:24:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122729206] [2025-01-09 15:24:30,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:30,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:24:30,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:24:30,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:30,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122729206] [2025-01-09 15:24:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122729206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:24:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861695517] [2025-01-09 15:24:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:24:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:24:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:24:31,310 INFO L87 Difference]: Start difference. First operand 328 states and 402 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:31,698 INFO L93 Difference]: Finished difference Result 656 states and 797 transitions. [2025-01-09 15:24:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:24:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2025-01-09 15:24:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:31,701 INFO L225 Difference]: With dead ends: 656 [2025-01-09 15:24:31,705 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 15:24:31,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:24:31,706 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 80 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:31,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1280 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:24:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 15:24:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 330. [2025-01-09 15:24:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 276 states have (on average 1.1956521739130435) internal successors, (330), 276 states have internal predecessors, (330), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:24:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2025-01-09 15:24:31,761 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 157 [2025-01-09 15:24:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:31,761 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2025-01-09 15:24:31,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2025-01-09 15:24:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:24:31,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:31,762 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:24:31,762 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -643605581, now seen corresponding path program 1 times [2025-01-09 15:24:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925212116] [2025-01-09 15:24:31,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:31,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:24:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:24:31,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:31,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:24:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:24:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925212116] [2025-01-09 15:24:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925212116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:32,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:24:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585810815] [2025-01-09 15:24:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:24:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:24:32,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:24:32,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:24:32,629 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:24:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:41,353 INFO L93 Difference]: Finished difference Result 670 states and 807 transitions. [2025-01-09 15:24:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:24:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 157 [2025-01-09 15:24:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:41,356 INFO L225 Difference]: With dead ends: 670 [2025-01-09 15:24:41,356 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 15:24:41,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:24:41,357 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 218 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:41,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1568 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:24:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 15:24:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 328. [2025-01-09 15:24:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 274 states have (on average 1.1824817518248176) internal successors, (324), 274 states have internal predecessors, (324), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:24:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 396 transitions. [2025-01-09 15:24:41,405 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 396 transitions. Word has length 157 [2025-01-09 15:24:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:41,405 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 396 transitions. [2025-01-09 15:24:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.0) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:24:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 396 transitions. [2025-01-09 15:24:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:24:41,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:41,406 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:41,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:24:41,407 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:41,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash -358348760, now seen corresponding path program 1 times [2025-01-09 15:24:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:24:41,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978620118] [2025-01-09 15:24:41,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:24:41,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:24:41,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:24:41,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:41,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:24:41,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:24:41,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:24:41,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:24:41,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:41,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:24:41,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:24:41,573 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:24:41,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:24:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:24:41,578 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 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-01-09 15:24:41,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:24:41,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:24:41 BoogieIcfgContainer [2025-01-09 15:24:41,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:24:41,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:24:41,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:24:41,658 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:24:41,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:23:52" (3/4) ... [2025-01-09 15:24:41,659 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:24:41,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:24:41,660 INFO L158 Benchmark]: Toolchain (without parser) took 50424.37ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 107.0MB in the beginning and 359.7MB in the end (delta: -252.7MB). Peak memory consumption was 480.5MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,661 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:41,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.40ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.00ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:24:41,661 INFO L158 Benchmark]: Boogie Preprocessor took 61.29ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 82.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,661 INFO L158 Benchmark]: RCFGBuilder took 541.79ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 50.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,662 INFO L158 Benchmark]: TraceAbstraction took 49521.00ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 49.2MB in the beginning and 359.9MB in the end (delta: -310.7MB). Peak memory consumption was 413.4MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,662 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 872.4MB. Free memory was 359.9MB in the beginning and 359.7MB in the end (delta: 183.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:24:41,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.40ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.1MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.00ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.29ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 82.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 541.79ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 50.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49521.00ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 49.2MB in the beginning and 359.9MB in the end (delta: -310.7MB). Peak memory consumption was 413.4MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 872.4MB. Free memory was 359.9MB in the beginning and 359.7MB in the end (delta: 183.3kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] isInitial = 1 [L101] FCALL initially() [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] RET updateVariables() [L105] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1][0] [L37] BOOL_unsigned_char_Array_0[1][2] = BOOL_unsigned_char_Array_0[1][0] [L38] EXPR unsigned_long_int_Array_0[1] [L38] EXPR unsigned_long_int_Array_0[0] [L38] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND TRUE unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2]) [L39] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L39] EXPR unsigned_short_int_Array_0[1] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] unsigned_short_int_Array_0[0] = ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))) [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L41] COND TRUE (double_Array_0[0] * 16.5f) > double_Array_0[1] [L42] EXPR BOOL_unsigned_char_Array_0[0][1] [L42] BOOL_unsigned_char_Array_0[0][2] = (! BOOL_unsigned_char_Array_0[0][1]) [L46] EXPR unsigned_short_int_Array_0[0] [L46] EXPR unsigned_long_int_Array_0[3] [L46] EXPR unsigned_long_int_Array_0[2] [L46] EXPR unsigned_short_int_Array_0[0] [L46] unsigned_long_int_Array_0[4] = (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] signed long int stepLocal_1 = (((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0])); [L48] EXPR unsigned_long_int_Array_0[3] [L48] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[3]; [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_0=1073741823, stepLocal_1=65534, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L49] COND TRUE stepLocal_1 != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]))) [L50] EXPR double_Array_0[0] [L50] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND FALSE !(double_Array_0[0] == double_Array_0[1]) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR unsigned_long_int_Array_0[4] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[3] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L96] EXPR BOOL_unsigned_char_Array_0[1][2] [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) [L96] EXPR unsigned_long_int_Array_0[1] [L96] EXPR unsigned_long_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L96] EXPR unsigned_short_int_Array_0[1] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) [L96] EXPR BOOL_unsigned_char_Array_0[0][2] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] [L96] EXPR BOOL_unsigned_char_Array_0[1][1] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96-L97] return ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.4s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4634 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4545 mSDsluCounter, 25560 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21582 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11028 IncrementalHoareTripleChecker+Invalid, 11743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 3978 mSDtfsCounter, 11028 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2193 GetRequests, 1802 SyntacticMatches, 7 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1351occurred in iteration=21, InterpolantAutomatonStates: 326, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2430 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 5043 NumberOfCodeBlocks, 5043 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5303 ConstructedInterpolants, 0 QuantifiedInterpolants, 26472 SizeOfPredicates, 35 NumberOfNonLiveVariables, 4158 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 21542/22032 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-01-09 15:24:41,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-53.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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:24:43,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:24:43,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:24:43,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:24:43,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:24:43,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:24:43,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:24:43,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:24:43,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:24:43,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:24:43,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:24:43,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:24:43,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:24:43,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:24:43,818 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:24:43,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:24:43,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:24:43,819 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:24:43,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:24:43,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:43,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:43,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:24:43,821 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:24:43,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:24:43,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:24:43,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:24:43,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:24:43,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:24:43,822 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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2025-01-09 15:24:44,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:24:44,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:24:44,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:24:44,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:24:44,086 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:24:44,087 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-53.i [2025-01-09 15:24:45,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49244fec1/a1d328ff3a204872b47a7ad96aecc609/FLAG0b4add8b9 [2025-01-09 15:24:45,448 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:24:45,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2025-01-09 15:24:45,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49244fec1/a1d328ff3a204872b47a7ad96aecc609/FLAG0b4add8b9 [2025-01-09 15:24:45,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49244fec1/a1d328ff3a204872b47a7ad96aecc609 [2025-01-09 15:24:45,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:24:45,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:24:45,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:45,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:24:45,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:24:45,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391dbdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45, skipping insertion in model container [2025-01-09 15:24:45,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:24:45,588 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-53.i[916,929] [2025-01-09 15:24:45,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:45,638 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:24:45,645 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-53.i[916,929] [2025-01-09 15:24:45,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:24:45,703 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:24:45,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45 WrapperNode [2025-01-09 15:24:45,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:24:45,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:45,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:24:45,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:24:45,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,751 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-01-09 15:24:45,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:24:45,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:24:45,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:24:45,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:24:45,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,793 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2025-01-09 15:24:45,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:24:45,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:24:45,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:24:45,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:24:45,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (1/1) ... [2025-01-09 15:24:45,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:24:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:24:45,863 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-01-09 15:24:45,869 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-01-09 15:24:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:24:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:24:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:24:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:24:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:24:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:24:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:24:45,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:24:45,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:24:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:24:45,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:24:45,990 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:24:45,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:24:46,551 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 15:24:46,551 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:24:46,558 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:24:46,558 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:24:46,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:46 BoogieIcfgContainer [2025-01-09 15:24:46,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:24:46,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:24:46,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:24:46,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:24:46,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:24:45" (1/3) ... [2025-01-09 15:24:46,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2f6f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:46, skipping insertion in model container [2025-01-09 15:24:46,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:24:45" (2/3) ... [2025-01-09 15:24:46,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2f6f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:24:46, skipping insertion in model container [2025-01-09 15:24:46,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:24:46" (3/3) ... [2025-01-09 15:24:46,565 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2025-01-09 15:24:46,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:24:46,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:24:46,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:24:46,609 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;@5e97b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:24:46,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:24:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:24:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:24:46,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:46,620 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:46,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:46,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1655323305, now seen corresponding path program 1 times [2025-01-09 15:24:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189372926] [2025-01-09 15:24:46,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:46,631 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-01-09 15:24:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:46,634 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-01-09 15:24:46,635 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-01-09 15:24:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:24:46,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:24:46,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:24:46,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-09 15:24:47,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:24:47,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:47,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189372926] [2025-01-09 15:24:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189372926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:24:47,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:24:47,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:24:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994707327] [2025-01-09 15:24:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:24:47,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:24:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:47,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:24:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:24:47,032 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:47,062 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-01-09 15:24:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:24:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-01-09 15:24:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:47,070 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:24:47,071 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:24:47,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-01-09 15:24:47,076 INFO L435 NwaCegarLoop]: 155 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, 155 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-01-09 15:24:47,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:24:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:24:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:24:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:24:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-01-09 15:24:47,116 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-01-09 15:24:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:47,116 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-01-09 15:24:47,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:24:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-01-09 15:24:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:24:47,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:47,120 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:47,136 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 (2)] Ended with exit code 0 [2025-01-09 15:24:47,325 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-01-09 15:24:47,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:47,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1073682249, now seen corresponding path program 1 times [2025-01-09 15:24:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:47,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991982919] [2025-01-09 15:24:47,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:47,328 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-01-09 15:24:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:47,330 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-01-09 15:24:47,331 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-01-09 15:24:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:24:47,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:24:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:47,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:24:47,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:47,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:24:47,852 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 38 treesize of output 16 [2025-01-09 15:24:48,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:48,025 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 63 treesize of output 53 [2025-01-09 15:24:48,033 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 40 treesize of output 32 [2025-01-09 15:24:48,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:48,281 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 60 treesize of output 24 [2025-01-09 15:24:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 15:24:48,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:48,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:24:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991982919] [2025-01-09 15:24:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991982919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592964328] [2025-01-09 15:24:48,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:48,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:24:48,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:24:48,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:24:48,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 15:24:48,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:24:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:24:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:49,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:24:49,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:49,644 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-01-09 15:24:50,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 15:24:50,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:50,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2025-01-09 15:24:50,306 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 34 treesize of output 26 [2025-01-09 15:24:50,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:50,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 24 [2025-01-09 15:24:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 15:24:50,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:24:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [592964328] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:24:50,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:24:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-01-09 15:24:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226914035] [2025-01-09 15:24:50,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:24:50,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:24:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:24:50,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:24:50,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:24:50,785 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 15:24:54,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:24:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:24:55,798 INFO L93 Difference]: Finished difference Result 266 states and 376 transitions. [2025-01-09 15:24:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 15:24:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 140 [2025-01-09 15:24:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:24:55,803 INFO L225 Difference]: With dead ends: 266 [2025-01-09 15:24:55,803 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 15:24:55,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:24:55,804 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 215 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:24:55,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1503 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1299 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 15:24:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 15:24:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2025-01-09 15:24:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 122 states have internal predecessors, (158), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:24:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2025-01-09 15:24:55,839 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 140 [2025-01-09 15:24:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:24:55,839 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2025-01-09 15:24:55,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 15:24:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2025-01-09 15:24:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 15:24:55,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:24:55,841 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:24:55,851 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-01-09 15:24:56,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 15:24:56,242 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:24:56,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:24:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:24:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2084799499, now seen corresponding path program 1 times [2025-01-09 15:24:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:24:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747572024] [2025-01-09 15:24:56,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:24:56,243 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-01-09 15:24:56,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:24:56,245 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-01-09 15:24:56,246 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-01-09 15:24:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:24:56,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:24:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:24:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:24:56,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:24:56,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:24:56,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:24:56,811 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 44 treesize of output 36 [2025-01-09 15:24:56,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:24:56,816 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 55 treesize of output 45 [2025-01-09 15:25:00,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:00,272 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 102 treesize of output 54 [2025-01-09 15:25:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-09 15:25:00,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:00,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747572024] [2025-01-09 15:25:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747572024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833905142] [2025-01-09 15:25:00,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:25:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:25:00,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:25:00,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 15:25:00,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 15:25:01,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 15:25:01,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:01,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:25:01,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:01,646 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-01-09 15:25:02,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:02,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2025-01-09 15:25:02,220 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 34 treesize of output 26 [2025-01-09 15:25:04,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:04,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 24 [2025-01-09 15:25:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-09 15:25:04,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1833905142] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:04,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:25:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-01-09 15:25:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354980062] [2025-01-09 15:25:04,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:25:04,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:25:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:04,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:25:04,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:25:04,827 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 15:25:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:08,258 INFO L93 Difference]: Finished difference Result 287 states and 391 transitions. [2025-01-09 15:25:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 15:25:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 140 [2025-01-09 15:25:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:08,262 INFO L225 Difference]: With dead ends: 287 [2025-01-09 15:25:08,262 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 15:25:08,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:25:08,268 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 532 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:08,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1391 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 15:25:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 15:25:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-01-09 15:25:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.2857142857142858) internal successors, (162), 127 states have internal predecessors, (162), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:25:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 222 transitions. [2025-01-09 15:25:08,290 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 222 transitions. Word has length 140 [2025-01-09 15:25:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:08,290 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 222 transitions. [2025-01-09 15:25:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 15:25:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 222 transitions. [2025-01-09 15:25:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:25:08,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:08,293 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:08,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:08,503 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-01-09 15:25:08,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-01-09 15:25:08,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:08,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1589101644, now seen corresponding path program 1 times [2025-01-09 15:25:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076681622] [2025-01-09 15:25:08,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:08,696 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-01-09 15:25:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:08,703 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-01-09 15:25:08,704 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-01-09 15:25:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:25:08,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:25:08,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:08,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:25:08,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:25:09,008 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-01-09 15:25:09,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:09,083 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-01-09 15:25:09,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:09,514 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-01-09 15:25:09,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:09,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2025-01-09 15:25:09,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:09,647 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 84 treesize of output 36 [2025-01-09 15:25:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-01-09 15:25:09,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:25:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:25:09,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076681622] [2025-01-09 15:25:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076681622] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:25:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54482688] [2025-01-09 15:25:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:09,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:09,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:09,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:25:09,837 INFO L87 Difference]: Start difference. First operand 163 states and 222 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18)