./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.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-sp_file-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:17:00,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:17:00,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:17:00,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:17:00,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:17:00,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:17:00,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:17:00,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:17:00,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:17:00,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:17:00,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:17:00,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:17:00,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:17:00,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:17:00,395 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:00,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:00,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:17:00,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:17:00,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:17:00,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:17:00,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:17:00,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:17:00,396 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2025-01-09 16:17:00,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:17:00,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:17:00,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:17:00,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:17:00,579 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:17:00,580 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-sp_file-92.i [2025-01-09 16:17:01,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2176a40a6/f44afe4cb0b64fac98b849a17907e063/FLAG0c7e2b0a7 [2025-01-09 16:17:02,025 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:17:02,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2025-01-09 16:17:02,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2176a40a6/f44afe4cb0b64fac98b849a17907e063/FLAG0c7e2b0a7 [2025-01-09 16:17:02,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2176a40a6/f44afe4cb0b64fac98b849a17907e063 [2025-01-09 16:17:02,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:17:02,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:17:02,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:02,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:17:02,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:17:02,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4e4b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02, skipping insertion in model container [2025-01-09 16:17:02,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:17:02,226 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-sp_file-92.i[917,930] [2025-01-09 16:17:02,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:02,298 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:17:02,307 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-sp_file-92.i[917,930] [2025-01-09 16:17:02,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:02,369 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:17:02,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02 WrapperNode [2025-01-09 16:17:02,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:02,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:02,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:17:02,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:17:02,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,413 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-01-09 16:17:02,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:02,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:17:02,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:17:02,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:17:02,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,442 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:17:02,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:17:02,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:17:02,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:17:02,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:17:02,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (1/1) ... [2025-01-09 16:17:02,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:02,530 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 16:17:02,539 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 16:17:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:17:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:17:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:17:02,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:17:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:17:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:17:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:17:02,665 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:17:02,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:17:03,183 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-01-09 16:17:03,183 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:17:03,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:17:03,195 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:17:03,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:03 BoogieIcfgContainer [2025-01-09 16:17:03,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:17:03,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:17:03,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:17:03,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:17:03,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:02" (1/3) ... [2025-01-09 16:17:03,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:03, skipping insertion in model container [2025-01-09 16:17:03,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:02" (2/3) ... [2025-01-09 16:17:03,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f623a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:03, skipping insertion in model container [2025-01-09 16:17:03,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:03" (3/3) ... [2025-01-09 16:17:03,204 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2025-01-09 16:17:03,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:17:03,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-92.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:17:03,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:17:03,271 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;@27ffae03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:17:03,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:17:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:17:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:03,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:03,286 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:03,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:03,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 755059624, now seen corresponding path program 1 times [2025-01-09 16:17:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982920119] [2025-01-09 16:17:03,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:03,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:03,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:17:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982920119] [2025-01-09 16:17:03,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982920119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:03,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:03,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095601423] [2025-01-09 16:17:03,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:03,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:03,876 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:17:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:03,946 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2025-01-09 16:17:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:03,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 16:17:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:03,953 INFO L225 Difference]: With dead ends: 221 [2025-01-09 16:17:03,954 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 16:17:03,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:03,960 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:03,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 16:17:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 16:17:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:17:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-01-09 16:17:04,012 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2025-01-09 16:17:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-01-09 16:17:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:17:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-01-09 16:17:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:04,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:04,019 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:17:04,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 756906666, now seen corresponding path program 1 times [2025-01-09 16:17:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038043662] [2025-01-09 16:17:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:04,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:04,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:04,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 16:17:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038043662] [2025-01-09 16:17:06,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038043662] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371976194] [2025-01-09 16:17:06,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:06,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:06,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:06,587 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 16:17:06,591 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 16:17:06,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:06,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:06,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:06,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:06,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 16:17:06,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:06,952 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 16:17:07,313 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 23 treesize of output 11 [2025-01-09 16:17:07,587 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 23 treesize of output 11 [2025-01-09 16:17:07,809 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 23 treesize of output 11 [2025-01-09 16:17:08,054 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 23 treesize of output 11 [2025-01-09 16:17:08,332 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 23 treesize of output 11 [2025-01-09 16:17:08,505 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 23 treesize of output 11 [2025-01-09 16:17:08,646 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 23 treesize of output 11 [2025-01-09 16:17:08,938 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 23 treesize of output 11 [2025-01-09 16:17:09,116 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 23 treesize of output 11 [2025-01-09 16:17:09,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:09,310 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 23 treesize of output 11 [2025-01-09 16:17:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:09,359 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 23 treesize of output 11 [2025-01-09 16:17:09,378 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 15 treesize of output 7 [2025-01-09 16:17:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 184 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-01-09 16:17:09,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:17:09,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371976194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:09,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:17:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-01-09 16:17:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496051125] [2025-01-09 16:17:09,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:17:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:17:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:09,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:17:09,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:17:09,532 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2025-01-09 16:17:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:10,140 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2025-01-09 16:17:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:17:10,140 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) Word has length 153 [2025-01-09 16:17:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:10,142 INFO L225 Difference]: With dead ends: 227 [2025-01-09 16:17:10,142 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 16:17:10,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:17:10,144 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 136 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:10,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 580 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:17:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 16:17:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2025-01-09 16:17:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:17:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2025-01-09 16:17:10,154 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 153 [2025-01-09 16:17:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:10,154 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2025-01-09 16:17:10,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.470588235294118) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2025-01-09 16:17:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2025-01-09 16:17:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:10,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:10,156 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:10,163 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 16:17:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:10,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:10,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1179608492, now seen corresponding path program 1 times [2025-01-09 16:17:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455734468] [2025-01-09 16:17:10,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:10,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:17:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455734468] [2025-01-09 16:17:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455734468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:17:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166154517] [2025-01-09 16:17:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:17:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:17:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:17:17,279 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:19,937 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2025-01-09 16:17:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:17:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 16:17:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:19,947 INFO L225 Difference]: With dead ends: 285 [2025-01-09 16:17:19,949 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 16:17:19,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:17:19,950 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 471 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:19,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 655 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 16:17:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 16:17:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2025-01-09 16:17:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 111 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:17:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2025-01-09 16:17:19,974 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 153 [2025-01-09 16:17:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:19,974 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2025-01-09 16:17:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2025-01-09 16:17:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:19,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:19,977 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:19,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:17:19,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -100255186, now seen corresponding path program 1 times [2025-01-09 16:17:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:19,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692823784] [2025-01-09 16:17:19,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:20,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:20,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:20,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:17:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692823784] [2025-01-09 16:17:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692823784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:17:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922433698] [2025-01-09 16:17:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:23,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:17:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:23,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:17:23,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:17:23,636 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:25,064 INFO L93 Difference]: Finished difference Result 299 states and 416 transitions. [2025-01-09 16:17:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 16:17:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:25,066 INFO L225 Difference]: With dead ends: 299 [2025-01-09 16:17:25,066 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 16:17:25,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:17:25,068 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 329 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:25,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 610 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:17:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 16:17:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2025-01-09 16:17:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:17:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 184 transitions. [2025-01-09 16:17:25,099 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 184 transitions. Word has length 153 [2025-01-09 16:17:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:25,099 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 184 transitions. [2025-01-09 16:17:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 184 transitions. [2025-01-09 16:17:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:25,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:25,103 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:25,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:17:25,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:25,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1192130770, now seen corresponding path program 1 times [2025-01-09 16:17:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460830629] [2025-01-09 16:17:25,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:25,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:25,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:25,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:25,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:17:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460830629] [2025-01-09 16:17:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460830629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:17:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964025721] [2025-01-09 16:17:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:17:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:28,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:17:28,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:17:28,028 INFO L87 Difference]: Start difference. First operand 133 states and 184 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:29,299 INFO L93 Difference]: Finished difference Result 319 states and 438 transitions. [2025-01-09 16:17:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 16:17:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:29,302 INFO L225 Difference]: With dead ends: 319 [2025-01-09 16:17:29,302 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 16:17:29,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:17:29,303 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 218 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:29,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 576 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:17:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 16:17:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2025-01-09 16:17:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.314102564102564) internal successors, (205), 157 states have internal predecessors, (205), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:17:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2025-01-09 16:17:29,341 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 153 [2025-01-09 16:17:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:29,341 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2025-01-09 16:17:29,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:17:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2025-01-09 16:17:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:17:29,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:29,344 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:17:29,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:29,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1822972848, now seen corresponding path program 1 times [2025-01-09 16:17:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142302853] [2025-01-09 16:17:29,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:29,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:17:29,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:17:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:17:36,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142302853] [2025-01-09 16:17:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142302853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:36,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:17:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690029666] [2025-01-09 16:17:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:17:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:17:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:17:36,075 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:17:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:39,080 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2025-01-09 16:17:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:17:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 16:17:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:39,083 INFO L225 Difference]: With dead ends: 371 [2025-01-09 16:17:39,083 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 16:17:39,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:17:39,084 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 261 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:39,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 960 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 16:17:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 16:17:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-01-09 16:17:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 16:17:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2025-01-09 16:17:39,113 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 153 [2025-01-09 16:17:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:39,113 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2025-01-09 16:17:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:17:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2025-01-09 16:17:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 16:17:39,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:39,115 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:17:39,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:17:39,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1265006247, now seen corresponding path program 1 times [2025-01-09 16:17:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864103706] [2025-01-09 16:17:39,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 16:17:39,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 16:17:39,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:39,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 16:17:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864103706] [2025-01-09 16:17:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864103706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980006174] [2025-01-09 16:17:40,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:40,035 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 16:17:40,036 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 16:17:40,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 16:17:40,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 16:17:40,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:40,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:40,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 16:17:40,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:42,130 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 16:17:42,905 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 23 treesize of output 11 [2025-01-09 16:17:43,475 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 23 treesize of output 11 [2025-01-09 16:17:43,882 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 23 treesize of output 11 [2025-01-09 16:17:44,275 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 23 treesize of output 11 [2025-01-09 16:17:45,192 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 23 treesize of output 11 [2025-01-09 16:17:45,723 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 23 treesize of output 11 [2025-01-09 16:17:46,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,359 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 23 treesize of output 11 [2025-01-09 16:17:46,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,660 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 30 treesize of output 21 [2025-01-09 16:17:46,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,813 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 30 treesize of output 21 [2025-01-09 16:17:46,899 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-09 16:17:46,899 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 2 case distinctions, treesize of input 65 treesize of output 62 [2025-01-09 16:17:46,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2025-01-09 16:17:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:46,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2025-01-09 16:17:47,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,077 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2025-01-09 16:17:47,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 95 [2025-01-09 16:17:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,150 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2025-01-09 16:17:47,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 95 [2025-01-09 16:17:47,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,452 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2025-01-09 16:17:47,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 72 [2025-01-09 16:17:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,723 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 16:17:47,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2025-01-09 16:17:47,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:17:47,787 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-01-09 16:17:47,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 31 [2025-01-09 16:17:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 166 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-01-09 16:17:47,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:17:51,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1 (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))))) is different from false [2025-01-09 16:17:52,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1027 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1025))) (or (not (= (store (select |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1025 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1025)) (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1))) (< (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) is different from false [2025-01-09 16:17:52,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base))) (and (or (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))) (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1027 Int)) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1025))) (or (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1))) (< (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2) (not (= v_ArrVal_1025 (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1025 c_~WrapperStruct00_var_1_17_Pointer~0.offset))))))))) (or (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1027 Int)) (let ((.cse6 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (let ((.cse4 (store .cse6 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1025))) (or (< (select (select .cse4 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2) (let ((.cse5 (store .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse5 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse5 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1))) (not (= v_ArrVal_1025 (store (select .cse6 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1025 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))))))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) is different from false [2025-01-09 16:17:52,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_1022 Int)) (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1022)))) (or (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1027 Int)) (let ((.cse2 (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (let ((.cse0 (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1025))) (or (< (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse1 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) (select (select .cse1 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 1))) (not (= (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1025 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1025)))))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select .cse3 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))) (forall ((v_ArrVal_1022 Int)) (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1022)))) (or (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1027 Int)) (let ((.cse7 (store .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (let ((.cse6 (store .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1025))) (or (let ((.cse5 (store .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1027)))) (< (select (select .cse5 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (+ (select (select .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) (select (select .cse5 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 1))) (not (= (store (select .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1025 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1025)) (< (select (select .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2))))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select .cse8 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))) is different from false [2025-01-09 16:17:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980006174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:58,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:17:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 31 [2025-01-09 16:17:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110655282] [2025-01-09 16:17:58,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:17:58,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 16:17:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:58,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 16:17:58,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1350, Unknown=9, NotChecked=308, Total=1806 [2025-01-09 16:17:58,537 INFO L87 Difference]: Start difference. First operand 184 states and 250 transitions. Second operand has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 30 states have internal predecessors, (124), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2025-01-09 16:18:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:18:07,360 INFO L93 Difference]: Finished difference Result 787 states and 1056 transitions. [2025-01-09 16:18:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 16:18:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 30 states have internal predecessors, (124), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) Word has length 155 [2025-01-09 16:18:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:18:07,363 INFO L225 Difference]: With dead ends: 787 [2025-01-09 16:18:07,363 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 16:18:07,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=815, Invalid=5354, Unknown=9, NotChecked=628, Total=6806 [2025-01-09 16:18:07,365 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 956 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:18:07,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1710 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 16:18:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 16:18:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 405. [2025-01-09 16:18:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 336 states have (on average 1.2827380952380953) internal successors, (431), 340 states have internal predecessors, (431), 54 states have call successors, (54), 14 states have call predecessors, (54), 14 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 16:18:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 539 transitions. [2025-01-09 16:18:07,454 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 539 transitions. Word has length 155 [2025-01-09 16:18:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:18:07,454 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 539 transitions. [2025-01-09 16:18:07,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.275862068965517) internal successors, (124), 30 states have internal predecessors, (124), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2025-01-09 16:18:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 539 transitions. [2025-01-09 16:18:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 16:18:07,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:18:07,456 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:07,464 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 16:18:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:18:07,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:18:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:18:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1988218351, now seen corresponding path program 1 times [2025-01-09 16:18:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:18:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404817826] [2025-01-09 16:18:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:18:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:18:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 16:18:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 16:18:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:18:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:18:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:18:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:18:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404817826] [2025-01-09 16:18:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404817826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:18:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:18:12,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:18:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978708786] [2025-01-09 16:18:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:18:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:18:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:18:12,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:18:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:18:12,183 INFO L87 Difference]: Start difference. First operand 405 states and 539 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:18:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:18:13,887 INFO L93 Difference]: Finished difference Result 820 states and 1087 transitions. [2025-01-09 16:18:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:18:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2025-01-09 16:18:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:18:13,889 INFO L225 Difference]: With dead ends: 820 [2025-01-09 16:18:13,890 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 16:18:13,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:18:13,891 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 467 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:18:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 406 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:18:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 16:18:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 365. [2025-01-09 16:18:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 301 states have (on average 1.2790697674418605) internal successors, (385), 304 states have internal predecessors, (385), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 16:18:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 485 transitions. [2025-01-09 16:18:13,973 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 485 transitions. Word has length 157 [2025-01-09 16:18:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:18:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 485 transitions. [2025-01-09 16:18:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:18:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 485 transitions. [2025-01-09 16:18:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 16:18:13,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:18:13,974 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:18:13,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:18:13,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:18:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1273937323, now seen corresponding path program 1 times [2025-01-09 16:18:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:18:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916710661] [2025-01-09 16:18:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:18:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:18:13,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 16:18:14,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 16:18:14,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:18:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:18:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 16:18:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:18:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916710661] [2025-01-09 16:18:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916710661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:18:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481333979] [2025-01-09 16:18:14,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:18:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:18:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:18:14,988 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 16:18:14,990 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 16:18:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 16:18:15,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 16:18:15,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:18:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:18:15,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 16:18:15,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:18:16,051 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 16:18:16,438 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 23 treesize of output 11 [2025-01-09 16:18:16,909 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 30 treesize of output 21 [2025-01-09 16:18:17,144 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 30 treesize of output 21 [2025-01-09 16:18:17,363 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 30 treesize of output 21 [2025-01-09 16:18:17,836 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 30 treesize of output 21 [2025-01-09 16:18:18,137 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 30 treesize of output 21 [2025-01-09 16:18:18,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:18:18,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:18:18,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:18:18,504 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 16:18:18,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2025-01-09 16:18:18,624 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 16:18:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 24 [2025-01-09 16:18:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 314 proven. 187 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 16:18:18,654 INFO L312 TraceCheckSpWp]: Computing backward predicates...