./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.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-s_file-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:40,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:40,895 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:03:40,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:40,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:40,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:40,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:40,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:40,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:40,927 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:40,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:40,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:40,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:40,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:40,928 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:40,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:40,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:40,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:40,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:40,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:40,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:40,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:40,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:40,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:40,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:40,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:40,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:40,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:40,932 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2025-01-09 16:03:41,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:41,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:41,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:41,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:41,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:41,174 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-s_file-83.i [2025-01-09 16:03:42,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae1c33ab/471ce27ec56e4ee2b3fba92528006a76/FLAGeba837cc9 [2025-01-09 16:03:42,598 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:42,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2025-01-09 16:03:42,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae1c33ab/471ce27ec56e4ee2b3fba92528006a76/FLAGeba837cc9 [2025-01-09 16:03:42,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae1c33ab/471ce27ec56e4ee2b3fba92528006a76 [2025-01-09 16:03:42,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:42,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:42,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:42,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:42,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:42,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:42" (1/1) ... [2025-01-09 16:03:42,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:42, skipping insertion in model container [2025-01-09 16:03:42,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:42" (1/1) ... [2025-01-09 16:03:42,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:43,016 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-s_file-83.i[916,929] [2025-01-09 16:03:43,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:43,061 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:43,068 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-s_file-83.i[916,929] [2025-01-09 16:03:43,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:43,122 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:43,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43 WrapperNode [2025-01-09 16:03:43,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:43,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:43,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:43,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:43,131 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:03:43" (1/1) ... [2025-01-09 16:03:43,140 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:03:43" (1/1) ... [2025-01-09 16:03:43,167 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2025-01-09 16:03:43,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:43,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:43,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:43,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:43,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,188 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:03:43,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:43,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:43,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:43,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:43,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (1/1) ... [2025-01-09 16:03:43,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:43,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:43,260 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:03:43,265 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:03:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:03:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:03:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:03:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:43,363 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:43,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:43,760 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:43,760 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:43,770 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:43,772 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:43,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:43 BoogieIcfgContainer [2025-01-09 16:03:43,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:43,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:43,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:43,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:43,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:42" (1/3) ... [2025-01-09 16:03:43,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee31790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:43, skipping insertion in model container [2025-01-09 16:03:43,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:43" (2/3) ... [2025-01-09 16:03:43,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee31790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:43, skipping insertion in model container [2025-01-09 16:03:43,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:43" (3/3) ... [2025-01-09 16:03:43,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2025-01-09 16:03:43,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:43,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-83.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:43,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:43,848 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;@60b72a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:43,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:43,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:43,862 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1471701412, now seen corresponding path program 1 times [2025-01-09 16:03:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072083267] [2025-01-09 16:03:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:44,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:44,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:44,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:03:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072083267] [2025-01-09 16:03:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072083267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:44,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116257461] [2025-01-09 16:03:44,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:44,152 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:03:44,154 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:03:44,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:44,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:44,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:44,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:44,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:03:44,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116257461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:03:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97275815] [2025-01-09 16:03:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:44,391 INFO L87 Difference]: Start difference. First operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:44,410 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2025-01-09 16:03:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:44,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-01-09 16:03:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:44,416 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:03:44,416 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 16:03:44,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:44,420 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:44,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 16:03:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 16:03:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-01-09 16:03:44,451 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2025-01-09 16:03:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:44,451 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-01-09 16:03:44,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-01-09 16:03:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:44,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:44,455 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:44,461 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:03:44,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:03:44,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2002516782, now seen corresponding path program 1 times [2025-01-09 16:03:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332933274] [2025-01-09 16:03:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332933274] [2025-01-09 16:03:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332933274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:44,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818148413] [2025-01-09 16:03:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:44,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:44,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:44,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:44,971 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:45,007 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2025-01-09 16:03:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:45,012 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:03:45,012 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:03:45,013 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:03:45,013 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:45,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:03:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-01-09 16:03:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-01-09 16:03:45,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2025-01-09 16:03:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:45,028 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-01-09 16:03:45,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-01-09 16:03:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:45,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:45,029 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:03:45,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:45,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -517443152, now seen corresponding path program 1 times [2025-01-09 16:03:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3334763] [2025-01-09 16:03:45,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:45,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:45,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:45,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:45,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3334763] [2025-01-09 16:03:45,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3334763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:45,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155991691] [2025-01-09 16:03:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:45,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:45,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:45,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:45,178 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:45,204 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2025-01-09 16:03:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:45,208 INFO L225 Difference]: With dead ends: 220 [2025-01-09 16:03:45,210 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 16:03:45,211 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:03:45,211 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:45,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 16:03:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-01-09 16:03:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-01-09 16:03:45,220 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2025-01-09 16:03:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:45,220 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-01-09 16:03:45,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-01-09 16:03:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:45,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:45,223 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:03:45,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -515596110, now seen corresponding path program 1 times [2025-01-09 16:03:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254212641] [2025-01-09 16:03:45,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:45,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:45,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254212641] [2025-01-09 16:03:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254212641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650783082] [2025-01-09 16:03:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:45,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:45,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:45,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:45,556 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:45,786 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2025-01-09 16:03:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:45,789 INFO L225 Difference]: With dead ends: 260 [2025-01-09 16:03:45,789 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 16:03:45,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:45,790 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 136 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:45,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 300 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 16:03:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2025-01-09 16:03:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2025-01-09 16:03:45,802 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 106 [2025-01-09 16:03:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2025-01-09 16:03:45,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2025-01-09 16:03:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:03:45,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:45,806 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:03:45,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:45,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash -758232161, now seen corresponding path program 1 times [2025-01-09 16:03:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42067426] [2025-01-09 16:03:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:45,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:03:45,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:03:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42067426] [2025-01-09 16:03:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42067426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854808537] [2025-01-09 16:03:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:46,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:46,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:46,052 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:46,297 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2025-01-09 16:03:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-01-09 16:03:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:46,298 INFO L225 Difference]: With dead ends: 223 [2025-01-09 16:03:46,298 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 16:03:46,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:46,299 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:46,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 437 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 16:03:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 16:03:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-01-09 16:03:46,304 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 107 [2025-01-09 16:03:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-01-09 16:03:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-01-09 16:03:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:46,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:46,306 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:03:46,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -25048915, now seen corresponding path program 1 times [2025-01-09 16:03:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798206112] [2025-01-09 16:03:46,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:46,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:46,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:46,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:46,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798206112] [2025-01-09 16:03:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798206112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:46,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:03:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714424527] [2025-01-09 16:03:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:46,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:46,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:46,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:46,724 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:03:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:47,043 INFO L93 Difference]: Finished difference Result 225 states and 313 transitions. [2025-01-09 16:03:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-01-09 16:03:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:47,046 INFO L225 Difference]: With dead ends: 225 [2025-01-09 16:03:47,046 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 16:03:47,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:03:47,046 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 225 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:47,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 203 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:03:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 16:03:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 16:03:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2025-01-09 16:03:47,056 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 108 [2025-01-09 16:03:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2025-01-09 16:03:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:03:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2025-01-09 16:03:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:47,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:47,061 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:03:47,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:47,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 757896428, now seen corresponding path program 1 times [2025-01-09 16:03:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:47,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371997883] [2025-01-09 16:03:47,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:47,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:47,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:47,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:47,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371997883] [2025-01-09 16:03:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371997883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:03:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21235488] [2025-01-09 16:03:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:48,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:48,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:48,089 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:48,545 INFO L93 Difference]: Finished difference Result 304 states and 417 transitions. [2025-01-09 16:03:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:03:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 16:03:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:48,547 INFO L225 Difference]: With dead ends: 304 [2025-01-09 16:03:48,547 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 16:03:48,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:48,548 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 83 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:48,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 660 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 16:03:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2025-01-09 16:03:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 173 states have internal predecessors, (230), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:03:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2025-01-09 16:03:48,565 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 108 [2025-01-09 16:03:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:48,565 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2025-01-09 16:03:48,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2025-01-09 16:03:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:48,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:48,567 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:48,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:03:48,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:48,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -263171926, now seen corresponding path program 1 times [2025-01-09 16:03:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-01-09 16:03:48,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:48,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:48,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:48,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:48,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283381111] [2025-01-09 16:03:48,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:48,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:48,656 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:03:48,658 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:03:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:48,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:48,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:48,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:48,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 16:03:48,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:48,969 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 71 treesize of output 70 [2025-01-09 16:03:49,141 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 114 treesize of output 96 [2025-01-09 16:03:49,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:49,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-01-09 16:03:49,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:49,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 14 [2025-01-09 16:03:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:49,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-01-09 16:03:49,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:03:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283381111] [2025-01-09 16:03:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283381111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:49,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:49,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:03:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029497164] [2025-01-09 16:03:49,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:49,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:49,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:49,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:49,435 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:53,956 INFO L93 Difference]: Finished difference Result 730 states and 1003 transitions. [2025-01-09 16:03:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-01-09 16:03:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:53,963 INFO L225 Difference]: With dead ends: 730 [2025-01-09 16:03:53,964 INFO L226 Difference]: Without dead ends: 543 [2025-01-09 16:03:53,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:53,965 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 333 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:53,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1009 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 16:03:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-09 16:03:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 238. [2025-01-09 16:03:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 209 states have internal predecessors, (275), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 16:03:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 327 transitions. [2025-01-09 16:03:53,995 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 327 transitions. Word has length 108 [2025-01-09 16:03:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:53,995 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 327 transitions. [2025-01-09 16:03:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2025-01-09 16:03:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:53,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:53,996 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:54,009 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:03:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:54,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1123031468, now seen corresponding path program 1 times [2025-01-09 16:03:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703457209] [2025-01-09 16:03:54,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:54,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:54,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703457209] [2025-01-09 16:04:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703457209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:04:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497969421] [2025-01-09 16:04:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:09,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:09,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:09,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:09,124 INFO L87 Difference]: Start difference. First operand 238 states and 327 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:10,056 INFO L93 Difference]: Finished difference Result 510 states and 700 transitions. [2025-01-09 16:04:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:04:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-01-09 16:04:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:10,058 INFO L225 Difference]: With dead ends: 510 [2025-01-09 16:04:10,059 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 16:04:10,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:10,060 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:10,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 650 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:04:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 16:04:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 259. [2025-01-09 16:04:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 229 states have (on average 1.331877729257642) internal successors, (305), 230 states have internal predecessors, (305), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 16:04:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2025-01-09 16:04:10,074 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 108 [2025-01-09 16:04:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2025-01-09 16:04:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2025-01-09 16:04:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:04:10,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:10,075 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:04:10,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1583587926, now seen corresponding path program 1 times [2025-01-09 16:04:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416730212] [2025-01-09 16:04:10,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:10,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:10,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:10,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098055617] [2025-01-09 16:04:10,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:10,137 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:04:10,139 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:04:10,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:10,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:10,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:10,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:04:10,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:10,596 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 65 treesize of output 64 [2025-01-09 16:04:10,895 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 120 treesize of output 100 [2025-01-09 16:04:11,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:11,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2025-01-09 16:04:11,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:11,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-01-09 16:04:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:11,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:11,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416730212] [2025-01-09 16:04:11,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:11,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098055617] [2025-01-09 16:04:11,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098055617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:11,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:11,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:04:11,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120057442] [2025-01-09 16:04:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:11,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:04:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:11,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:04:11,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:11,383 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:16,024 INFO L93 Difference]: Finished difference Result 783 states and 1074 transitions. [2025-01-09 16:04:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:04:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-01-09 16:04:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:16,027 INFO L225 Difference]: With dead ends: 783 [2025-01-09 16:04:16,027 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 16:04:16,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:04:16,028 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 474 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:16,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 735 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 16:04:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 16:04:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 275. [2025-01-09 16:04:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 245 states have (on average 1.3387755102040817) internal successors, (328), 246 states have internal predecessors, (328), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 16:04:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 380 transitions. [2025-01-09 16:04:16,057 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 380 transitions. Word has length 108 [2025-01-09 16:04:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 380 transitions. [2025-01-09 16:04:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 380 transitions. [2025-01-09 16:04:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:04:16,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:16,059 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:16,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:04:16,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:16,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1634626732, now seen corresponding path program 1 times [2025-01-09 16:04:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588977591] [2025-01-09 16:04:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:16,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:16,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:16,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588977591] [2025-01-09 16:04:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588977591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:04:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295781353] [2025-01-09 16:04:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:17,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:17,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:17,259 INFO L87 Difference]: Start difference. First operand 275 states and 380 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:18,328 INFO L93 Difference]: Finished difference Result 564 states and 778 transitions. [2025-01-09 16:04:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:04:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-01-09 16:04:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:18,330 INFO L225 Difference]: With dead ends: 564 [2025-01-09 16:04:18,331 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 16:04:18,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:18,333 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 95 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:18,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 835 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:04:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 16:04:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 295. [2025-01-09 16:04:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 265 states have (on average 1.3433962264150943) internal successors, (356), 266 states have internal predecessors, (356), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 16:04:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 408 transitions. [2025-01-09 16:04:18,351 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 408 transitions. Word has length 108 [2025-01-09 16:04:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:18,352 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 408 transitions. [2025-01-09 16:04:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 408 transitions. [2025-01-09 16:04:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:04:18,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:18,354 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:04:18,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash 613558378, now seen corresponding path program 1 times [2025-01-09 16:04:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:18,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713641332] [2025-01-09 16:04:18,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:18,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:18,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:18,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713641332] [2025-01-09 16:04:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713641332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267735254] [2025-01-09 16:04:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:18,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:04:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:04:18,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:18,819 INFO L87 Difference]: Start difference. First operand 295 states and 408 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:04:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:19,126 INFO L93 Difference]: Finished difference Result 598 states and 823 transitions. [2025-01-09 16:04:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:04:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 16:04:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:19,128 INFO L225 Difference]: With dead ends: 598 [2025-01-09 16:04:19,128 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 16:04:19,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:04:19,129 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 78 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:19,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 862 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 16:04:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2025-01-09 16:04:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 334 states have (on average 1.344311377245509) internal successors, (449), 336 states have internal predecessors, (449), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:04:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-01-09 16:04:19,143 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 108 [2025-01-09 16:04:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:19,143 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-01-09 16:04:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:04:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-01-09 16:04:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:04:19,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:19,145 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:19,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:04:19,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1071992662, now seen corresponding path program 1 times [2025-01-09 16:04:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895096687] [2025-01-09 16:04:19,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:19,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:19,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:19,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:19,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899465634] [2025-01-09 16:04:19,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:19,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:19,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:19,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:04:19,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:19,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:19,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:19,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:19,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 16:04:19,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:19,525 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 71 treesize of output 70 [2025-01-09 16:04:19,709 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 114 treesize of output 96 [2025-01-09 16:04:19,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 16:04:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:19,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895096687] [2025-01-09 16:04:19,935 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899465634] [2025-01-09 16:04:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899465634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480963858] [2025-01-09 16:04:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:19,936 INFO L87 Difference]: Start difference. First operand 367 states and 505 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:22,843 INFO L93 Difference]: Finished difference Result 1042 states and 1434 transitions. [2025-01-09 16:04:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-01-09 16:04:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:22,847 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 16:04:22,847 INFO L226 Difference]: Without dead ends: 742 [2025-01-09 16:04:22,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:22,848 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 165 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:22,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 586 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 16:04:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-01-09 16:04:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 404. [2025-01-09 16:04:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 371 states have (on average 1.3450134770889488) internal successors, (499), 373 states have internal predecessors, (499), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:04:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 555 transitions. [2025-01-09 16:04:22,864 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 555 transitions. Word has length 108 [2025-01-09 16:04:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:22,865 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 555 transitions. [2025-01-09 16:04:22,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 555 transitions. [2025-01-09 16:04:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:04:22,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:22,866 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:22,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:04:23,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:04:23,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:23,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash 6706618, now seen corresponding path program 1 times [2025-01-09 16:04:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124210150] [2025-01-09 16:04:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:23,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:23,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:23,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:23,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19300115] [2025-01-09 16:04:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:23,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:23,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:04:23,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:23,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:23,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:23,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:23,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:04:23,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:23,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:23,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-01-09 16:04:23,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:23,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 19 [2025-01-09 16:04:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:23,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124210150] [2025-01-09 16:04:23,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19300115] [2025-01-09 16:04:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19300115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927088943] [2025-01-09 16:04:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:23,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:23,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:23,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:23,805 INFO L87 Difference]: Start difference. First operand 404 states and 555 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:24,945 INFO L93 Difference]: Finished difference Result 853 states and 1164 transitions. [2025-01-09 16:04:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 16:04:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:24,948 INFO L225 Difference]: With dead ends: 853 [2025-01-09 16:04:24,948 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 16:04:24,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:24,949 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 213 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:24,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 835 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:04:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 16:04:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 544. [2025-01-09 16:04:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 493 states have (on average 1.3346855983772818) internal successors, (658), 497 states have internal predecessors, (658), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 39 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 16:04:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 744 transitions. [2025-01-09 16:04:24,973 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 744 transitions. Word has length 109 [2025-01-09 16:04:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:24,973 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 744 transitions. [2025-01-09 16:04:24,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 744 transitions. [2025-01-09 16:04:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:04:24,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:24,975 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:24,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:04:25,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:04:25,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:25,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1880988930, now seen corresponding path program 1 times [2025-01-09 16:04:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624912439] [2025-01-09 16:04:25,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:25,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:25,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:25,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803451157] [2025-01-09 16:04:25,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:25,220 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:25,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:04:25,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:25,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:04:25,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:25,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:25,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:25,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:25,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2025-01-09 16:04:25,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:25,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 65 [2025-01-09 16:04:25,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:25,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 25 [2025-01-09 16:04:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:25,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624912439] [2025-01-09 16:04:25,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803451157] [2025-01-09 16:04:25,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803451157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:25,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912090349] [2025-01-09 16:04:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:25,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:25,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:25,790 INFO L87 Difference]: Start difference. First operand 544 states and 744 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:26,452 INFO L93 Difference]: Finished difference Result 996 states and 1353 transitions. [2025-01-09 16:04:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:04:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 16:04:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:26,455 INFO L225 Difference]: With dead ends: 996 [2025-01-09 16:04:26,455 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 16:04:26,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:26,456 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 266 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:26,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 664 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:04:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 16:04:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 544. [2025-01-09 16:04:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 494 states have (on average 1.3299595141700404) internal successors, (657), 498 states have internal predecessors, (657), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 739 transitions. [2025-01-09 16:04:26,475 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 739 transitions. Word has length 109 [2025-01-09 16:04:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:26,476 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 739 transitions. [2025-01-09 16:04:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 739 transitions. [2025-01-09 16:04:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:04:26,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:26,477 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:26,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:04:26,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 16:04:26,681 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:26,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash -292641028, now seen corresponding path program 1 times [2025-01-09 16:04:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:26,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779830992] [2025-01-09 16:04:26,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:26,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:26,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:26,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755832937] [2025-01-09 16:04:26,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:26,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:26,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:26,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:26,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:04:26,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:26,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:26,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:26,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:26,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:04:26,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:26,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:26,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:26,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:26,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:27,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:27,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 53 [2025-01-09 16:04:27,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:27,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 25 [2025-01-09 16:04:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:27,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779830992] [2025-01-09 16:04:27,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755832937] [2025-01-09 16:04:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755832937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:27,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843166921] [2025-01-09 16:04:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:04:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:04:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:27,248 INFO L87 Difference]: Start difference. First operand 544 states and 739 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:28,615 INFO L93 Difference]: Finished difference Result 989 states and 1338 transitions. [2025-01-09 16:04:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:04:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 16:04:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:28,618 INFO L225 Difference]: With dead ends: 989 [2025-01-09 16:04:28,618 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 16:04:28,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:28,619 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 344 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:28,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 951 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 16:04:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 16:04:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2025-01-09 16:04:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 492 states have (on average 1.329268292682927) internal successors, (654), 496 states have internal predecessors, (654), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 736 transitions. [2025-01-09 16:04:28,645 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 736 transitions. Word has length 109 [2025-01-09 16:04:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:28,647 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 736 transitions. [2025-01-09 16:04:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 736 transitions. [2025-01-09 16:04:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:04:28,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:28,649 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:28,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:04:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:28,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1617686774, now seen corresponding path program 1 times [2025-01-09 16:04:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:28,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452457203] [2025-01-09 16:04:28,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:28,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:28,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817964973] [2025-01-09 16:04:28,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:28,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:04:28,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:04:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:29,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:29,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:29,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:29,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:04:29,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:29,486 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 71 treesize of output 70 [2025-01-09 16:04:29,652 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 114 treesize of output 96 [2025-01-09 16:04:29,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:29,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:29,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:29,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 52 [2025-01-09 16:04:30,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:30,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 72 [2025-01-09 16:04:30,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:30,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 23 [2025-01-09 16:04:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:30,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452457203] [2025-01-09 16:04:30,307 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:30,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817964973] [2025-01-09 16:04:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817964973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:30,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:30,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:04:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109113426] [2025-01-09 16:04:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:30,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:04:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:30,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:04:30,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:30,308 INFO L87 Difference]: Start difference. First operand 542 states and 736 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:33,583 INFO L93 Difference]: Finished difference Result 1331 states and 1807 transitions. [2025-01-09 16:04:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:04:33,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 16:04:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:33,586 INFO L225 Difference]: With dead ends: 1331 [2025-01-09 16:04:33,586 INFO L226 Difference]: Without dead ends: 893 [2025-01-09 16:04:33,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:04:33,587 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 267 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:33,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 765 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 16:04:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-01-09 16:04:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 546. [2025-01-09 16:04:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 496 states have (on average 1.3286290322580645) internal successors, (659), 500 states have internal predecessors, (659), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 741 transitions. [2025-01-09 16:04:33,605 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 741 transitions. Word has length 109 [2025-01-09 16:04:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:33,605 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 741 transitions. [2025-01-09 16:04:33,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 741 transitions. [2025-01-09 16:04:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:04:33,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:33,607 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:33,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:04:33,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 16:04:33,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash -270008774, now seen corresponding path program 1 times [2025-01-09 16:04:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763784298] [2025-01-09 16:04:33,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:33,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:33,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338798587] [2025-01-09 16:04:33,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:33,861 INFO L229 MonitoredProcess]: Starting monitored process 10 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:04:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:04:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:04:34,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:04:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:34,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:04:34,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:34,125 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 65 treesize of output 64 [2025-01-09 16:04:34,267 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 114 treesize of output 96 [2025-01-09 16:04:34,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:34,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:34,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 55 [2025-01-09 16:04:34,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 58 [2025-01-09 16:04:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:34,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763784298] [2025-01-09 16:04:34,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338798587] [2025-01-09 16:04:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338798587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:34,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272479891] [2025-01-09 16:04:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:34,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:34,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:34,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:34,673 INFO L87 Difference]: Start difference. First operand 546 states and 741 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:38,382 INFO L93 Difference]: Finished difference Result 1278 states and 1734 transitions. [2025-01-09 16:04:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:04:38,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 16:04:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:38,385 INFO L225 Difference]: With dead ends: 1278 [2025-01-09 16:04:38,385 INFO L226 Difference]: Without dead ends: 840 [2025-01-09 16:04:38,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:04:38,387 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 375 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:38,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 771 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 16:04:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-01-09 16:04:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 550. [2025-01-09 16:04:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 500 states have (on average 1.328) internal successors, (664), 504 states have internal predecessors, (664), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 746 transitions. [2025-01-09 16:04:38,405 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 746 transitions. Word has length 109 [2025-01-09 16:04:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:38,405 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 746 transitions. [2025-01-09 16:04:38,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 746 transitions. [2025-01-09 16:04:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:04:38,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:38,406 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 16:04:38,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:04:38,614 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 856822251, now seen corresponding path program 1 times [2025-01-09 16:04:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000370423] [2025-01-09 16:04:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:38,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:38,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:38,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:38,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123961246] [2025-01-09 16:04:38,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:38,655 INFO L229 MonitoredProcess]: Starting monitored process 11 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:04:38,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:04:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:38,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:38,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:38,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:38,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 16:04:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:38,971 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 43 treesize of output 42 [2025-01-09 16:04:39,006 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 82 treesize of output 62 [2025-01-09 16:04:39,056 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:04:39,138 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 26 treesize of output 14 [2025-01-09 16:04:39,171 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 26 treesize of output 14 [2025-01-09 16:04:39,209 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 26 treesize of output 14 [2025-01-09 16:04:39,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:39,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-01-09 16:04:39,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:39,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 55 [2025-01-09 16:04:39,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:39,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 58 [2025-01-09 16:04:39,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:39,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 31 [2025-01-09 16:04:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 16:04:39,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000370423] [2025-01-09 16:04:40,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123961246] [2025-01-09 16:04:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123961246] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:40,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 16:04:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170182937] [2025-01-09 16:04:40,129 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 16:04:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:04:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:04:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:04:40,130 INFO L87 Difference]: Start difference. First operand 550 states and 746 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:41,157 INFO L93 Difference]: Finished difference Result 1275 states and 1724 transitions. [2025-01-09 16:04:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:04:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2025-01-09 16:04:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:41,160 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 16:04:41,160 INFO L226 Difference]: Without dead ends: 837 [2025-01-09 16:04:41,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:04:41,162 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 440 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:41,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 863 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:04:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-01-09 16:04:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 569. [2025-01-09 16:04:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 518 states have (on average 1.3262548262548262) internal successors, (687), 522 states have internal predecessors, (687), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 769 transitions. [2025-01-09 16:04:41,195 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 769 transitions. Word has length 110 [2025-01-09 16:04:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:41,195 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 769 transitions. [2025-01-09 16:04:41,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:04:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 769 transitions. [2025-01-09 16:04:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:04:41,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:41,196 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:41,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:04:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:41,397 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1900522859, now seen corresponding path program 1 times [2025-01-09 16:04:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:41,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26783714] [2025-01-09 16:04:41,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:41,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:41,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:41,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:41,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700557444] [2025-01-09 16:04:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:41,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:41,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:41,441 INFO L229 MonitoredProcess]: Starting monitored process 12 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:04:41,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:04:41,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:41,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:04:41,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:41,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:41,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:41,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:41,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 74 [2025-01-09 16:04:41,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:41,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 77 [2025-01-09 16:04:42,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:42,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 34 [2025-01-09 16:04:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:42,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:42,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26783714] [2025-01-09 16:04:42,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700557444] [2025-01-09 16:04:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700557444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:42,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719833072] [2025-01-09 16:04:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:42,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:42,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:42,151 INFO L87 Difference]: Start difference. First operand 569 states and 769 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:47,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 16:04:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:49,802 INFO L93 Difference]: Finished difference Result 1008 states and 1362 transitions. [2025-01-09 16:04:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:04:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:04:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:49,804 INFO L225 Difference]: With dead ends: 1008 [2025-01-09 16:04:49,804 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 16:04:49,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:49,805 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 88 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:49,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 601 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 16:04:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 16:04:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2025-01-09 16:04:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 517 states have (on average 1.3249516441005802) internal successors, (685), 521 states have internal predecessors, (685), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 767 transitions. [2025-01-09 16:04:49,824 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 767 transitions. Word has length 110 [2025-01-09 16:04:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:49,824 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 767 transitions. [2025-01-09 16:04:49,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 767 transitions. [2025-01-09 16:04:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:04:49,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:49,826 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:49,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 16:04:50,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:50,026 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:50,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1558422125, now seen corresponding path program 1 times [2025-01-09 16:04:50,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136631237] [2025-01-09 16:04:50,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:50,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:50,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:50,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:50,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874950503] [2025-01-09 16:04:50,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:50,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:50,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:50,077 INFO L229 MonitoredProcess]: Starting monitored process 13 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:04:50,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 16:04:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:50,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:50,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:50,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:04:50,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:50,410 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 71 treesize of output 70 [2025-01-09 16:04:50,593 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 114 treesize of output 96 [2025-01-09 16:04:50,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:04:50,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2025-01-09 16:04:50,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:50,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 57 [2025-01-09 16:04:50,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:50,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 60 [2025-01-09 16:04:51,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 20 [2025-01-09 16:04:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:51,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136631237] [2025-01-09 16:04:51,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:04:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874950503] [2025-01-09 16:04:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874950503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234337951] [2025-01-09 16:04:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:04:51,057 INFO L87 Difference]: Start difference. First operand 568 states and 767 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:53,933 INFO L93 Difference]: Finished difference Result 1266 states and 1710 transitions. [2025-01-09 16:04:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:04:53,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:04:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:53,936 INFO L225 Difference]: With dead ends: 1266 [2025-01-09 16:04:53,936 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 16:04:53,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:04:53,937 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 296 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:53,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 592 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 16:04:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 16:04:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 568. [2025-01-09 16:04:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 517 states have (on average 1.3249516441005802) internal successors, (685), 521 states have internal predecessors, (685), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 767 transitions. [2025-01-09 16:04:53,957 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 767 transitions. Word has length 110 [2025-01-09 16:04:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:53,957 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 767 transitions. [2025-01-09 16:04:53,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 767 transitions. [2025-01-09 16:04:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:04:53,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:53,958 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:53,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 16:04:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:54,159 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 899073768, now seen corresponding path program 1 times [2025-01-09 16:04:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612270032] [2025-01-09 16:04:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:54,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:54,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:54,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:54,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612270032] [2025-01-09 16:04:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612270032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:54,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:04:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138819014] [2025-01-09 16:04:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:54,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:54,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:54,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:54,304 INFO L87 Difference]: Start difference. First operand 568 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:54,640 INFO L93 Difference]: Finished difference Result 1414 states and 1918 transitions. [2025-01-09 16:04:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:04:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:54,644 INFO L225 Difference]: With dead ends: 1414 [2025-01-09 16:04:54,644 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 16:04:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:04:54,647 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 199 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 503 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 16:04:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 715. [2025-01-09 16:04:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 664 states have (on average 1.3313253012048192) internal successors, (884), 668 states have internal predecessors, (884), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 966 transitions. [2025-01-09 16:04:54,671 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 966 transitions. Word has length 110 [2025-01-09 16:04:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:54,672 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 966 transitions. [2025-01-09 16:04:54,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 966 transitions. [2025-01-09 16:04:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:04:54,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:54,673 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:54,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:04:54,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:54,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash 87545841, now seen corresponding path program 1 times [2025-01-09 16:04:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:54,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899975917] [2025-01-09 16:04:54,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:54,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:04:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:04:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:04:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899975917] [2025-01-09 16:04:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899975917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:55,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:55,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:04:55,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168821451] [2025-01-09 16:04:55,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:04:55,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:55,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:04:55,083 INFO L87 Difference]: Start difference. First operand 715 states and 966 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:04:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:55,375 INFO L93 Difference]: Finished difference Result 1221 states and 1657 transitions. [2025-01-09 16:04:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-01-09 16:04:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:55,379 INFO L225 Difference]: With dead ends: 1221 [2025-01-09 16:04:55,379 INFO L226 Difference]: Without dead ends: 657 [2025-01-09 16:04:55,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:04:55,381 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 446 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:04:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-09 16:04:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2025-01-09 16:04:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 604 states have (on average 1.326158940397351) internal successors, (801), 608 states have internal predecessors, (801), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 16:04:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 883 transitions. [2025-01-09 16:04:55,401 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 883 transitions. Word has length 110 [2025-01-09 16:04:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:55,401 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 883 transitions. [2025-01-09 16:04:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:04:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 883 transitions. [2025-01-09 16:04:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:04:55,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:55,403 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:04:55,403 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2127476532, now seen corresponding path program 1 times [2025-01-09 16:04:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:04:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392273656] [2025-01-09 16:04:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:04:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:55,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:55,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:55,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:04:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664801729] [2025-01-09 16:04:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:55,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:04:55,447 INFO L229 MonitoredProcess]: Starting monitored process 14 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:04:55,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 16:04:55,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:55,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:04:55,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:04:55,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:04:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:04:56,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:56,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:04:56,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:04:56,550 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:04:56,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:04:56,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 16:04:56,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:04:56,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:04:56,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:04:56,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:04:56 BoogieIcfgContainer [2025-01-09 16:04:56,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:04:56,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:04:56,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:04:56,790 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:04:56,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:43" (3/4) ... [2025-01-09 16:04:56,793 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:04:56,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:04:56,794 INFO L158 Benchmark]: Toolchain (without parser) took 73885.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 123.2MB in the beginning and 103.8MB in the end (delta: 19.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.80ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 106.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: Boogie Preprocessor took 62.27ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 99.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: RCFGBuilder took 541.27ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 64.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:04:56,794 INFO L158 Benchmark]: TraceAbstraction took 73015.94ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 64.6MB in the beginning and 103.9MB in the end (delta: -39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-01-09 16:04:56,795 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 243.3MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:04:56,795 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.80ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 106.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.27ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 99.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 541.27ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 64.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 73015.94ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 64.6MB in the beginning and 103.9MB in the end (delta: -39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 243.3MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L51] unsigned short int last_1_WrapperStruct00_var_1_1 = 128; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=128] [L110] isInitial = 1 [L111] FCALL initially() [L113] CALL updateLastVariables() [L103] EXPR WrapperStruct00.var_1_1 [L103] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L84] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L94] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L96] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L98] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L114] RET updateVariables() [L115] CALL step() [L55] WrapperStruct00.var_1_14 = 200 [L56] EXPR WrapperStruct00.var_1_16 [L56] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L57] EXPR WrapperStruct00.var_1_10 [L57] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_10 [L58] EXPR WrapperStruct00.var_1_3 [L58] EXPR WrapperStruct00.var_1_4 [L58] signed long int stepLocal_0 = WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4; [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=2] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=2] [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=2] [L62] COND TRUE stepLocal_0 >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)))) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_3 [L68] EXPR WrapperStruct00.var_1_1 [L68] signed long int stepLocal_2 = WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1; [L69] EXPR WrapperStruct00.var_1_14 [L69] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=3] [L69] EXPR WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=3] [L69] signed long int stepLocal_1 = WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15; [L70] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_1=1, stepLocal_2=3] [L70] COND FALSE !(WrapperStruct00.var_1_15 <= stepLocal_2) [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_10 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_1=1] [L79] COND FALSE !(WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) [L106] EXPR WrapperStruct00.var_1_15 [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) [L106] EXPR WrapperStruct00.var_1_8 [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106-L107] return (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.9s, OverallIterations: 24, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 4254 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4242 mSDsluCounter, 14303 SdHoareTripleChecker+Invalid, 34.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10940 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11015 IncrementalHoareTripleChecker+Invalid, 11376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 3363 mSDtfsCounter, 11015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1496 GetRequests, 1322 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=22, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 2575 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 4017 NumberOfCodeBlocks, 4017 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2572 ConstructedInterpolants, 17 QuantifiedInterpolants, 15117 SizeOfPredicates, 56 NumberOfNonLiveVariables, 4992 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 5248/5280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:04:57,002 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 16:04:57,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:04:58,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:04:58,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:04:58,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:04:58,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:04:58,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:04:58,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:04:58,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:04:58,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:04:58,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:04:58,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:04:58,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:04:58,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:04:58,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:04:58,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:04:58,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:04:58,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:04:58,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:04:58,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:04:58,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:04:58,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:04:58,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:04:58,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:04:58,712 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2025-01-09 16:04:58,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:04:58,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:04:58,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:04:58,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:04:58,952 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:04:58,953 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-s_file-83.i [2025-01-09 16:05:00,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526d69bb6/66b53e67fc664a32abce4297c54ecdd0/FLAG78f51d9fd [2025-01-09 16:05:00,295 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:05:00,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2025-01-09 16:05:00,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526d69bb6/66b53e67fc664a32abce4297c54ecdd0/FLAG78f51d9fd [2025-01-09 16:05:00,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/526d69bb6/66b53e67fc664a32abce4297c54ecdd0 [2025-01-09 16:05:00,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:05:00,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:05:00,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:00,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:05:00,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:05:00,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649e2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00, skipping insertion in model container [2025-01-09 16:05:00,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:05:00,450 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-s_file-83.i[916,929] [2025-01-09 16:05:00,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:00,510 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:05:00,519 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-s_file-83.i[916,929] [2025-01-09 16:05:00,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:00,590 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:05:00,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00 WrapperNode [2025-01-09 16:05:00,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:00,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:00,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:05:00,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:05:00,598 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:05:00" (1/1) ... [2025-01-09 16:05:00,612 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:05:00" (1/1) ... [2025-01-09 16:05:00,649 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2025-01-09 16:05:00,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:00,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:05:00,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:05:00,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:05:00,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,702 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-01-09 16:05:00,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:05:00,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:05:00,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:05:00,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:05:00,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (1/1) ... [2025-01-09 16:05:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:00,763 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:05:00,767 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:05:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:05:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:05:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:05:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:05:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:05:00,885 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:05:00,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:05:01,947 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-09 16:05:01,947 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:05:01,959 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:05:01,959 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:05:01,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:01 BoogieIcfgContainer [2025-01-09 16:05:01,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:05:01,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:05:01,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:05:01,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:05:01,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:05:00" (1/3) ... [2025-01-09 16:05:01,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36883751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:01, skipping insertion in model container [2025-01-09 16:05:01,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:00" (2/3) ... [2025-01-09 16:05:01,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36883751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:01, skipping insertion in model container [2025-01-09 16:05:01,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:01" (3/3) ... [2025-01-09 16:05:01,968 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2025-01-09 16:05:01,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:05:01,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-83.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:05:02,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:05:02,024 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;@42c0e16b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:05:02,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:05:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:05:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:05:02,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:02,040 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:02,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 830098782, now seen corresponding path program 1 times [2025-01-09 16:05:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:02,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199181652] [2025-01-09 16:05:02,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:02,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:02,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:02,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:02,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:05:02,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:05:02,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:05:02,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:02,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:02,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:05:02,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 16:05:02,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:02,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199181652] [2025-01-09 16:05:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199181652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:05:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865719951] [2025-01-09 16:05:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:02,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:05:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:02,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:05:02,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:05:02,393 INFO L87 Difference]: Start difference. First operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:05:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:02,411 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2025-01-09 16:05:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:05:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-01-09 16:05:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:02,416 INFO L225 Difference]: With dead ends: 198 [2025-01-09 16:05:02,416 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 16:05:02,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:05:02,419 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:02,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 16:05:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 16:05:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:05:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2025-01-09 16:05:02,450 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2025-01-09 16:05:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2025-01-09 16:05:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:05:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2025-01-09 16:05:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:05:02,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:02,452 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:02,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:05:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:02,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -851200336, now seen corresponding path program 1 times [2025-01-09 16:05:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204589694] [2025-01-09 16:05:02,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:02,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:02,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:02,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:05:02,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:05:02,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:05:02,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:02,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:02,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:05:02,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:05:02,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:02,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:02,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204589694] [2025-01-09 16:05:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204589694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:02,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793439881] [2025-01-09 16:05:02,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:02,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:05:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:02,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:05:02,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:02,992 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:03,044 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2025-01-09 16:05:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:05:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 16:05:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:03,047 INFO L225 Difference]: With dead ends: 200 [2025-01-09 16:05:03,048 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 16:05:03,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:03,049 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:03,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 16:05:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-01-09 16:05:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:05:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2025-01-09 16:05:03,058 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 104 [2025-01-09 16:05:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:03,063 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2025-01-09 16:05:03,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2025-01-09 16:05:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:05:03,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:03,064 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:05:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:03,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -171141966, now seen corresponding path program 1 times [2025-01-09 16:05:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741716773] [2025-01-09 16:05:03,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:03,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:03,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:03,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:03,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:05:03,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:05:03,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:05:03,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:03,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:05:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:05:03,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:03,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741716773] [2025-01-09 16:05:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741716773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:03,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328278143] [2025-01-09 16:05:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:03,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:03,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:03,547 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:03,594 INFO L93 Difference]: Finished difference Result 206 states and 285 transitions. [2025-01-09 16:05:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 16:05:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:03,595 INFO L225 Difference]: With dead ends: 206 [2025-01-09 16:05:03,595 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 16:05:03,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:03,596 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:03,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 16:05:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-01-09 16:05:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:05:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2025-01-09 16:05:03,602 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 104 [2025-01-09 16:05:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:03,602 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2025-01-09 16:05:03,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2025-01-09 16:05:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:05:03,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:03,603 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 16:05:03,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:03,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1603865396, now seen corresponding path program 1 times [2025-01-09 16:05:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716144690] [2025-01-09 16:05:03,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:03,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:03,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:03,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:03,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:05:03,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:05:04,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:05:04,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:04,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:04,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:05:04,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:05:04,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:04,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716144690] [2025-01-09 16:05:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716144690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:04,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:05:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426109162] [2025-01-09 16:05:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:04,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:05:04,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:04,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:05:04,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:04,108 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:04,165 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2025-01-09 16:05:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:05:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 16:05:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:04,167 INFO L225 Difference]: With dead ends: 210 [2025-01-09 16:05:04,167 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 16:05:04,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:04,167 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:04,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 16:05:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-01-09 16:05:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:05:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2025-01-09 16:05:04,179 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 104 [2025-01-09 16:05:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:04,179 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2025-01-09 16:05:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:05:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2025-01-09 16:05:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:05:04,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:04,180 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:04,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:05:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:04,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:04,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1605712438, now seen corresponding path program 1 times [2025-01-09 16:05:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031366792] [2025-01-09 16:05:04,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:04,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:04,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:05:04,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:05:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:05:04,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:04,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:04,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:05:04,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:04,752 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 101 treesize of output 100 [2025-01-09 16:05:04,934 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 145 treesize of output 129 [2025-01-09 16:05:05,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:05:05,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-01-09 16:05:05,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:05,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2025-01-09 16:05:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:05:05,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:05,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031366792] [2025-01-09 16:05:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031366792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:05,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125171415] [2025-01-09 16:05:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:05,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:05:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:05,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:05:05,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:05,249 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)