./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.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-34.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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:57:30,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:57:30,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:57:30,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:57:30,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:57:30,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:57:30,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:57:30,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:57:30,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:57:30,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:57:30,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:57:30,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:57:30,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:57:30,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:57:30,970 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:57:30,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:57:30,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:57:30,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:30,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:57:30,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:30,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:57:30,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:57:30,973 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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2025-01-09 15:57:31,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:57:31,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:57:31,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:57:31,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:57:31,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:57:31,218 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-34.i [2025-01-09 15:57:32,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f79b70e63/1c0247c448e342e6991341b0a693008b/FLAG3708eb7d6 [2025-01-09 15:57:32,722 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:57:32,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-01-09 15:57:32,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f79b70e63/1c0247c448e342e6991341b0a693008b/FLAG3708eb7d6 [2025-01-09 15:57:33,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f79b70e63/1c0247c448e342e6991341b0a693008b [2025-01-09 15:57:33,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:57:33,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:57:33,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:57:33,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:57:33,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:57:33,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c96991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33, skipping insertion in model container [2025-01-09 15:57:33,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:57:33,140 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-34.i[916,929] [2025-01-09 15:57:33,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:57:33,182 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:57:33,189 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-34.i[916,929] [2025-01-09 15:57:33,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:57:33,235 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:57:33,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33 WrapperNode [2025-01-09 15:57:33,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:57:33,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:57:33,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:57:33,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:57:33,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,276 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-01-09 15:57:33,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:57:33,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:57:33,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:57:33,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:57:33,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,303 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:57:33,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:57:33,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:57:33,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:57:33,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:57:33,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (1/1) ... [2025-01-09 15:57:33,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:33,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:57:33,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:57:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:57:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:57:33,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:57:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:57:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:57:33,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:57:33,460 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:57:33,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:57:33,858 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-01-09 15:57:33,858 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:57:33,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:57:33,865 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:57:33,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:33 BoogieIcfgContainer [2025-01-09 15:57:33,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:57:33,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:57:33,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:57:33,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:57:33,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:57:33" (1/3) ... [2025-01-09 15:57:33,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62066553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:33, skipping insertion in model container [2025-01-09 15:57:33,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:33" (2/3) ... [2025-01-09 15:57:33,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62066553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:33, skipping insertion in model container [2025-01-09 15:57:33,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:33" (3/3) ... [2025-01-09 15:57:33,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2025-01-09 15:57:33,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:57:33,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:57:33,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:57:33,925 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;@75c1358d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:57:33,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:57:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 15:57:33,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:33,937 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:33,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:33,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -652345464, now seen corresponding path program 1 times [2025-01-09 15:57:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258477140] [2025-01-09 15:57:33,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:57:34,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:57:34,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:34,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 15:57:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258477140] [2025-01-09 15:57:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258477140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286258385] [2025-01-09 15:57:34,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:34,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:57:34,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:57:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:57:34,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:57:34,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:34,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:34,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:57:34,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 15:57:34,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:57:34,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286258385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:34,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:57:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624337760] [2025-01-09 15:57:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:57:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:34,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:57:34,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:57:34,517 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:34,539 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-01-09 15:57:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:57:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-01-09 15:57:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:34,546 INFO L225 Difference]: With dead ends: 232 [2025-01-09 15:57:34,546 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:57:34,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:57:34,550 INFO L435 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:34,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:57:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:57:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-01-09 15:57:34,576 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-01-09 15:57:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:34,577 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-01-09 15:57:34,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-01-09 15:57:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 15:57:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:34,579 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:34,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:57:34,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:57:34,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:34,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1299455014, now seen corresponding path program 1 times [2025-01-09 15:57:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:34,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590236282] [2025-01-09 15:57:34,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:34,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:57:34,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:57:34,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:34,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590236282] [2025-01-09 15:57:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590236282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:35,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:35,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:57:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390614735] [2025-01-09 15:57:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:35,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:57:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:35,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:57:35,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:35,008 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:35,029 INFO L93 Difference]: Finished difference Result 230 states and 335 transitions. [2025-01-09 15:57:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:57:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-01-09 15:57:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:35,031 INFO L225 Difference]: With dead ends: 230 [2025-01-09 15:57:35,031 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 15:57:35,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:35,032 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:35,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 15:57:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 15:57:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-01-09 15:57:35,040 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 171 [2025-01-09 15:57:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:35,041 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-01-09 15:57:35,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-01-09 15:57:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 15:57:35,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:35,043 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:57:35,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 481806564, now seen corresponding path program 1 times [2025-01-09 15:57:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119829872] [2025-01-09 15:57:35,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:57:35,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:57:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:57:35,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119829872] [2025-01-09 15:57:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119829872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930961365] [2025-01-09 15:57:35,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:35,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:35,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:57:35,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:57:35,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:57:35,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:57:35,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:35,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:57:35,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:35,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:57:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930961365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:35,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:35,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:57:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815632008] [2025-01-09 15:57:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:35,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:57:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:35,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:57:35,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:57:35,578 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:35,618 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2025-01-09 15:57:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:57:35,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-01-09 15:57:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:35,620 INFO L225 Difference]: With dead ends: 233 [2025-01-09 15:57:35,620 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 15:57:35,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:57:35,621 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:35,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 15:57:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 15:57:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-01-09 15:57:35,629 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171 [2025-01-09 15:57:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:35,629 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-01-09 15:57:35,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-01-09 15:57:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 15:57:35,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:35,631 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:35,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:57:35,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:35,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:35,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash 76479318, now seen corresponding path program 1 times [2025-01-09 15:57:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:35,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326438518] [2025-01-09 15:57:35,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:35,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 15:57:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 15:57:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:35,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326438518] [2025-01-09 15:57:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326438518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:57:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124260398] [2025-01-09 15:57:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:35,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:57:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:35,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:57:35,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:35,962 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:35,987 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2025-01-09 15:57:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:57:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-01-09 15:57:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:35,989 INFO L225 Difference]: With dead ends: 285 [2025-01-09 15:57:35,989 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 15:57:35,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:35,990 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 15:57:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2025-01-09 15:57:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2025-01-09 15:57:36,003 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 173 [2025-01-09 15:57:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:36,004 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2025-01-09 15:57:36,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2025-01-09 15:57:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:57:36,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:36,009 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:57:36,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1765271437, now seen corresponding path program 1 times [2025-01-09 15:57:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165655078] [2025-01-09 15:57:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:57:36,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:57:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165655078] [2025-01-09 15:57:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165655078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:57:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355965267] [2025-01-09 15:57:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:36,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:57:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:36,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:57:36,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:36,157 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:36,173 INFO L93 Difference]: Finished difference Result 274 states and 397 transitions. [2025-01-09 15:57:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:57:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-01-09 15:57:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:36,175 INFO L225 Difference]: With dead ends: 274 [2025-01-09 15:57:36,176 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 15:57:36,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:36,177 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:36,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 15:57:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 15:57:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-01-09 15:57:36,190 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 176 [2025-01-09 15:57:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:36,191 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-01-09 15:57:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-01-09 15:57:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:57:36,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:36,194 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:36,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:57:36,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1942889845, now seen corresponding path program 1 times [2025-01-09 15:57:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218138341] [2025-01-09 15:57:36,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:36,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:57:36,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:57:36,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:36,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:36,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218138341] [2025-01-09 15:57:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218138341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646601878] [2025-01-09 15:57:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:36,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:36,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:36,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:36,865 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 15:57:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:37,212 INFO L93 Difference]: Finished difference Result 271 states and 391 transitions. [2025-01-09 15:57:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:57:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2025-01-09 15:57:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:37,214 INFO L225 Difference]: With dead ends: 271 [2025-01-09 15:57:37,214 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 15:57:37,214 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 15:57:37,215 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 193 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:37,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 250 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 15:57:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-01-09 15:57:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2025-01-09 15:57:37,222 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 176 [2025-01-09 15:57:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2025-01-09 15:57:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 15:57:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2025-01-09 15:57:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 15:57:37,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:37,224 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:37,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:57:37,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:37,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1071559423, now seen corresponding path program 1 times [2025-01-09 15:57:37,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113624866] [2025-01-09 15:57:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 15:57:37,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 15:57:37,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:37,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113624866] [2025-01-09 15:57:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113624866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684044939] [2025-01-09 15:57:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:37,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:37,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:37,737 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:38,069 INFO L93 Difference]: Finished difference Result 261 states and 374 transitions. [2025-01-09 15:57:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:57:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 178 [2025-01-09 15:57:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:38,071 INFO L225 Difference]: With dead ends: 261 [2025-01-09 15:57:38,071 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 15:57:38,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:57:38,072 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 172 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:38,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 241 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 15:57:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-01-09 15:57:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2025-01-09 15:57:38,080 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 178 [2025-01-09 15:57:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:38,081 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2025-01-09 15:57:38,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2025-01-09 15:57:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 15:57:38,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:38,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:38,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:57:38,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:38,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1187073313, now seen corresponding path program 1 times [2025-01-09 15:57:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464024245] [2025-01-09 15:57:38,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:38,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 15:57:38,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 15:57:38,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:38,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464024245] [2025-01-09 15:57:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464024245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:57:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440056551] [2025-01-09 15:57:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:57:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:38,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:57:38,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:38,191 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:38,256 INFO L93 Difference]: Finished difference Result 283 states and 402 transitions. [2025-01-09 15:57:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:57:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-01-09 15:57:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:38,258 INFO L225 Difference]: With dead ends: 283 [2025-01-09 15:57:38,258 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 15:57:38,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:57:38,259 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:38,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:57:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 15:57:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2025-01-09 15:57:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2025-01-09 15:57:38,267 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2025-01-09 15:57:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:38,267 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2025-01-09 15:57:38,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2025-01-09 15:57:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:38,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:38,269 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:57:38,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:38,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -888139063, now seen corresponding path program 1 times [2025-01-09 15:57:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487333646] [2025-01-09 15:57:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:38,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:38,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:38,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:38,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:38,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487333646] [2025-01-09 15:57:38,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487333646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:38,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:38,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:57:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355122011] [2025-01-09 15:57:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:38,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:57:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:38,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:57:38,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:57:38,983 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:39,418 INFO L93 Difference]: Finished difference Result 392 states and 549 transitions. [2025-01-09 15:57:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:57:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:39,420 INFO L225 Difference]: With dead ends: 392 [2025-01-09 15:57:39,420 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 15:57:39,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:57:39,421 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 137 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:39,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1435 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:57:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 15:57:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2025-01-09 15:57:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 226 transitions. [2025-01-09 15:57:39,432 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 226 transitions. Word has length 180 [2025-01-09 15:57:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:39,432 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 226 transitions. [2025-01-09 15:57:39,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 226 transitions. [2025-01-09 15:57:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:39,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:39,434 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:57:39,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:39,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -187074485, now seen corresponding path program 1 times [2025-01-09 15:57:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745312595] [2025-01-09 15:57:39,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:39,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:39,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:39,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:39,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745312595] [2025-01-09 15:57:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745312595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:57:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754749533] [2025-01-09 15:57:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:57:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:39,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:57:39,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:57:39,559 INFO L87 Difference]: Start difference. First operand 163 states and 226 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:39,577 INFO L93 Difference]: Finished difference Result 328 states and 456 transitions. [2025-01-09 15:57:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:57:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:39,578 INFO L225 Difference]: With dead ends: 328 [2025-01-09 15:57:39,578 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 15:57:39,579 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 15:57:39,579 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 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 15:57:39,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 15:57:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-01-09 15:57:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 142 states have (on average 1.295774647887324) internal successors, (184), 142 states have internal predecessors, (184), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2025-01-09 15:57:39,586 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 180 [2025-01-09 15:57:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2025-01-09 15:57:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2025-01-09 15:57:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:39,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:39,588 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:57:39,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -773880499, now seen corresponding path program 1 times [2025-01-09 15:57:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979368115] [2025-01-09 15:57:39,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:39,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:39,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:39,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979368115] [2025-01-09 15:57:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979368115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582547612] [2025-01-09 15:57:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:39,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:39,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:39,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:39,930 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:40,086 INFO L93 Difference]: Finished difference Result 378 states and 515 transitions. [2025-01-09 15:57:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:57:40,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:40,088 INFO L225 Difference]: With dead ends: 378 [2025-01-09 15:57:40,089 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 15:57:40,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:40,090 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 43 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:40,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 621 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:57:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 15:57:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 206. [2025-01-09 15:57:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 179 states have internal predecessors, (229), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:57:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2025-01-09 15:57:40,103 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 180 [2025-01-09 15:57:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:40,103 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2025-01-09 15:57:40,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2025-01-09 15:57:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:40,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:40,106 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:40,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:57:40,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:40,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2053744177, now seen corresponding path program 1 times [2025-01-09 15:57:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102510769] [2025-01-09 15:57:40,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:40,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:40,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:40,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102510769] [2025-01-09 15:57:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102510769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623860039] [2025-01-09 15:57:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:41,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:41,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:41,345 INFO L87 Difference]: Start difference. First operand 206 states and 279 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:41,600 INFO L93 Difference]: Finished difference Result 531 states and 714 transitions. [2025-01-09 15:57:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:57:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-01-09 15:57:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:41,603 INFO L225 Difference]: With dead ends: 531 [2025-01-09 15:57:41,603 INFO L226 Difference]: Without dead ends: 328 [2025-01-09 15:57:41,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 15:57:41,604 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 45 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:41,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 521 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:57:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-09 15:57:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2025-01-09 15:57:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 240 states have (on average 1.2958333333333334) internal successors, (311), 241 states have internal predecessors, (311), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:57:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 361 transitions. [2025-01-09 15:57:41,624 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 361 transitions. Word has length 180 [2025-01-09 15:57:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:41,624 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 361 transitions. [2025-01-09 15:57:41,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 361 transitions. [2025-01-09 15:57:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:41,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:41,627 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:41,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:57:41,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:41,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash -747590453, now seen corresponding path program 1 times [2025-01-09 15:57:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279470662] [2025-01-09 15:57:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:41,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:41,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279470662] [2025-01-09 15:57:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279470662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:57:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578262312] [2025-01-09 15:57:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:41,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:57:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:41,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:57:41,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:57:41,716 INFO L87 Difference]: Start difference. First operand 268 states and 361 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:41,734 INFO L93 Difference]: Finished difference Result 504 states and 681 transitions. [2025-01-09 15:57:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:57:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:41,736 INFO L225 Difference]: With dead ends: 504 [2025-01-09 15:57:41,736 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 15:57:41,736 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 15:57:41,736 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 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 15:57:41,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 15:57:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-01-09 15:57:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 212 states have internal predecessors, (271), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:57:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2025-01-09 15:57:41,748 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 180 [2025-01-09 15:57:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:41,749 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2025-01-09 15:57:41,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2025-01-09 15:57:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:41,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:41,750 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:41,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:57:41,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:41,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash -130516143, now seen corresponding path program 1 times [2025-01-09 15:57:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:41,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727232489] [2025-01-09 15:57:41,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:41,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:41,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727232489] [2025-01-09 15:57:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727232489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:42,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:42,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407323221] [2025-01-09 15:57:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:42,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:42,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:42,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:42,804 INFO L87 Difference]: Start difference. First operand 239 states and 321 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:43,096 INFO L93 Difference]: Finished difference Result 631 states and 843 transitions. [2025-01-09 15:57:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:57:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-01-09 15:57:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:43,099 INFO L225 Difference]: With dead ends: 631 [2025-01-09 15:57:43,102 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 15:57:43,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 15:57:43,104 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:43,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 424 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 15:57:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 326. [2025-01-09 15:57:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 298 states have (on average 1.2953020134228188) internal successors, (386), 299 states have internal predecessors, (386), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:57:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 436 transitions. [2025-01-09 15:57:43,132 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 436 transitions. Word has length 180 [2025-01-09 15:57:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:43,133 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 436 transitions. [2025-01-09 15:57:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 436 transitions. [2025-01-09 15:57:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:43,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:43,138 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:57:43,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:43,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1175637581, now seen corresponding path program 1 times [2025-01-09 15:57:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936708029] [2025-01-09 15:57:43,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:43,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:43,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:43,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936708029] [2025-01-09 15:57:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936708029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391205963] [2025-01-09 15:57:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:43,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:43,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:43,424 INFO L87 Difference]: Start difference. First operand 326 states and 436 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:43,594 INFO L93 Difference]: Finished difference Result 662 states and 882 transitions. [2025-01-09 15:57:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:57:43,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:43,597 INFO L225 Difference]: With dead ends: 662 [2025-01-09 15:57:43,597 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 15:57:43,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:43,599 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 126 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:43,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 503 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:57:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 15:57:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 301. [2025-01-09 15:57:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 273 states have (on average 1.2857142857142858) internal successors, (351), 274 states have internal predecessors, (351), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:57:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2025-01-09 15:57:43,612 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 180 [2025-01-09 15:57:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:43,612 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2025-01-09 15:57:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2025-01-09 15:57:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:43,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:43,614 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:43,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:57:43,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:43,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1255687251, now seen corresponding path program 1 times [2025-01-09 15:57:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:43,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465395153] [2025-01-09 15:57:43,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:43,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:43,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:43,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:43,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465395153] [2025-01-09 15:57:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465395153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179620217] [2025-01-09 15:57:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:43,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:43,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:43,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:43,851 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:44,081 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2025-01-09 15:57:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:44,084 INFO L225 Difference]: With dead ends: 610 [2025-01-09 15:57:44,084 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 15:57:44,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:44,085 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 127 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 616 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:57:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 15:57:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 239. [2025-01-09 15:57:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 317 transitions. [2025-01-09 15:57:44,097 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 317 transitions. Word has length 180 [2025-01-09 15:57:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:44,097 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 317 transitions. [2025-01-09 15:57:44,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 317 transitions. [2025-01-09 15:57:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:44,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:44,100 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:44,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:57:44,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:44,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:44,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1733126321, now seen corresponding path program 1 times [2025-01-09 15:57:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:44,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137947756] [2025-01-09 15:57:44,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:44,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137947756] [2025-01-09 15:57:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137947756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:45,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:45,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786966085] [2025-01-09 15:57:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:45,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:45,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:45,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:45,104 INFO L87 Difference]: Start difference. First operand 239 states and 317 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:45,461 INFO L93 Difference]: Finished difference Result 501 states and 663 transitions. [2025-01-09 15:57:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-01-09 15:57:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:45,463 INFO L225 Difference]: With dead ends: 501 [2025-01-09 15:57:45,463 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 15:57:45,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 15:57:45,464 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 44 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:45,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 626 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 15:57:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2025-01-09 15:57:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.2582159624413145) internal successors, (268), 213 states have internal predecessors, (268), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2025-01-09 15:57:45,474 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 180 [2025-01-09 15:57:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2025-01-09 15:57:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2025-01-09 15:57:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:45,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:45,476 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:57:45,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:45,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1975034961, now seen corresponding path program 1 times [2025-01-09 15:57:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458611422] [2025-01-09 15:57:45,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:45,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:45,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:46,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458611422] [2025-01-09 15:57:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458611422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:46,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295534822] [2025-01-09 15:57:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:46,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:46,256 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:46,604 INFO L93 Difference]: Finished difference Result 507 states and 664 transitions. [2025-01-09 15:57:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:46,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-01-09 15:57:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:46,605 INFO L225 Difference]: With dead ends: 507 [2025-01-09 15:57:46,606 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 15:57:46,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 15:57:46,607 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 55 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:46,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 650 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 15:57:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2025-01-09 15:57:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 209 states have internal predecessors, (262), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 308 transitions. [2025-01-09 15:57:46,615 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 308 transitions. Word has length 180 [2025-01-09 15:57:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:46,616 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 308 transitions. [2025-01-09 15:57:46,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 308 transitions. [2025-01-09 15:57:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:46,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:46,617 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:46,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:57:46,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:46,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash 695171283, now seen corresponding path program 1 times [2025-01-09 15:57:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:46,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307981406] [2025-01-09 15:57:46,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:46,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:46,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:46,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:46,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:46,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:46,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307981406] [2025-01-09 15:57:46,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307981406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:46,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:46,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:57:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485626998] [2025-01-09 15:57:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:46,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:46,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:57:46,816 INFO L87 Difference]: Start difference. First operand 235 states and 308 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:46,993 INFO L93 Difference]: Finished difference Result 503 states and 656 transitions. [2025-01-09 15:57:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:46,995 INFO L225 Difference]: With dead ends: 503 [2025-01-09 15:57:46,995 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 15:57:46,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:46,996 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 77 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:46,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 582 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:57:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 15:57:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2025-01-09 15:57:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:57:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 307 transitions. [2025-01-09 15:57:47,006 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 307 transitions. Word has length 180 [2025-01-09 15:57:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:47,007 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 307 transitions. [2025-01-09 15:57:47,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 307 transitions. [2025-01-09 15:57:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:47,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:47,008 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:57:47,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1396235861, now seen corresponding path program 1 times [2025-01-09 15:57:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:47,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873828607] [2025-01-09 15:57:47,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873828607] [2025-01-09 15:57:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873828607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:48,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:48,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:57:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12274343] [2025-01-09 15:57:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:48,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:57:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:48,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:57:48,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:57:48,300 INFO L87 Difference]: Start difference. First operand 235 states and 307 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:49,131 INFO L93 Difference]: Finished difference Result 512 states and 669 transitions. [2025-01-09 15:57:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:57:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-01-09 15:57:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:49,133 INFO L225 Difference]: With dead ends: 512 [2025-01-09 15:57:49,133 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 15:57:49,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:57:49,133 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:49,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1410 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:57:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 15:57:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2025-01-09 15:57:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 245 states have internal predecessors, (306), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:57:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2025-01-09 15:57:49,148 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 180 [2025-01-09 15:57:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2025-01-09 15:57:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:57:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2025-01-09 15:57:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:57:49,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:49,150 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:57:49,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1177630470, now seen corresponding path program 1 times [2025-01-09 15:57:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643048158] [2025-01-09 15:57:49,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:57:49,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:57:49,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:49,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643048158] [2025-01-09 15:57:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643048158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:57:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758294362] [2025-01-09 15:57:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:57:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:49,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:57:49,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:57:49,357 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:49,537 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2025-01-09 15:57:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:57:49,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:57:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:49,539 INFO L225 Difference]: With dead ends: 724 [2025-01-09 15:57:49,540 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 15:57:49,541 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 15:57:49,541 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:49,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 362 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:57:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 15:57:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 340. [2025-01-09 15:57:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 282 states have (on average 1.2304964539007093) internal successors, (347), 283 states have internal predecessors, (347), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 15:57:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 449 transitions. [2025-01-09 15:57:49,558 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 449 transitions. Word has length 180 [2025-01-09 15:57:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 449 transitions. [2025-01-09 15:57:49,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 449 transitions. [2025-01-09 15:57:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 15:57:49,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:49,560 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:49,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:57:49,560 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 526867540, now seen corresponding path program 1 times [2025-01-09 15:57:49,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:49,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18564135] [2025-01-09 15:57:49,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:49,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 15:57:49,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 15:57:49,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:57:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18564135] [2025-01-09 15:57:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18564135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763429859] [2025-01-09 15:57:49,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:49,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:49,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:57:49,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:57:49,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 15:57:49,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 15:57:49,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:49,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:49,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:57:49,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:49,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:57:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763429859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:57:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038067729] [2025-01-09 15:57:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:49,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:57:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:49,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:57:49,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:49,959 INFO L87 Difference]: Start difference. First operand 340 states and 449 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:49,989 INFO L93 Difference]: Finished difference Result 620 states and 816 transitions. [2025-01-09 15:57:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:57:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-01-09 15:57:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:49,993 INFO L225 Difference]: With dead ends: 620 [2025-01-09 15:57:49,993 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 15:57:49,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:57:49,996 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 15:57:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-01-09 15:57:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 288 states have (on average 1.2256944444444444) internal successors, (353), 289 states have internal predecessors, (353), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 15:57:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 455 transitions. [2025-01-09 15:57:50,011 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 455 transitions. Word has length 182 [2025-01-09 15:57:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:50,011 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 455 transitions. [2025-01-09 15:57:50,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 455 transitions. [2025-01-09 15:57:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 15:57:50,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:50,013 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:50,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:57:50,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:50,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash -61494739, now seen corresponding path program 1 times [2025-01-09 15:57:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:50,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679487301] [2025-01-09 15:57:50,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:50,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 15:57:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 15:57:50,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:50,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:57:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679487301] [2025-01-09 15:57:50,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679487301] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874364027] [2025-01-09 15:57:50,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:57:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:50,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:57:50,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:57:50,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 15:57:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 15:57:50,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:50,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:50,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:57:50,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:50,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:57:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874364027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-01-09 15:57:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698878951] [2025-01-09 15:57:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:50,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:50,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:50,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:57:50,677 INFO L87 Difference]: Start difference. First operand 346 states and 455 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:50,702 INFO L93 Difference]: Finished difference Result 356 states and 466 transitions. [2025-01-09 15:57:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:50,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2025-01-09 15:57:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:50,704 INFO L225 Difference]: With dead ends: 356 [2025-01-09 15:57:50,704 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 15:57:50,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:57:50,704 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:50,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:57:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 15:57:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-09 15:57:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 296 states have (on average 1.2195945945945945) internal successors, (361), 297 states have internal predecessors, (361), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 15:57:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2025-01-09 15:57:50,727 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 184 [2025-01-09 15:57:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2025-01-09 15:57:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2025-01-09 15:57:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 15:57:50,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:50,728 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:50,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:57:50,933 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,SelfDestructingSolverStorable22 [2025-01-09 15:57:50,933 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:50,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -118753041, now seen corresponding path program 1 times [2025-01-09 15:57:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798260403] [2025-01-09 15:57:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:50,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 15:57:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 15:57:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:57:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:57:51,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798260403] [2025-01-09 15:57:51,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798260403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:57:51,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:57:51,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:57:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574496242] [2025-01-09 15:57:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:51,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:57:51,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:57:51,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:57:51,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:57:51,221 INFO L87 Difference]: Start difference. First operand 354 states and 463 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:51,518 INFO L93 Difference]: Finished difference Result 633 states and 820 transitions. [2025-01-09 15:57:51,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:57:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2025-01-09 15:57:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:51,521 INFO L225 Difference]: With dead ends: 633 [2025-01-09 15:57:51,521 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 15:57:51,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:57:51,522 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 95 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:51,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 953 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:57:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 15:57:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 620. [2025-01-09 15:57:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 534 states have (on average 1.2303370786516854) internal successors, (657), 537 states have internal predecessors, (657), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 15:57:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 807 transitions. [2025-01-09 15:57:51,542 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 807 transitions. Word has length 184 [2025-01-09 15:57:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 807 transitions. [2025-01-09 15:57:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:57:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 807 transitions. [2025-01-09 15:57:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 15:57:51,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:51,543 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:57:51,544 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:51,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -962758543, now seen corresponding path program 1 times [2025-01-09 15:57:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:57:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438954285] [2025-01-09 15:57:51,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:57:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 15:57:51,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 15:57:51,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:51,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:57:51,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:57:51,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 15:57:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 15:57:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:57:51,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:57:51,699 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:57:51,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:57:51,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:57:51,703 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:51,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:57:51,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:57:51 BoogieIcfgContainer [2025-01-09 15:57:51,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:57:51,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:57:51,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:57:51,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:57:51,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:33" (3/4) ... [2025-01-09 15:57:51,770 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:57:51,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:57:51,771 INFO L158 Benchmark]: Toolchain (without parser) took 18747.01ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 110.6MB in the beginning and 507.6MB in the end (delta: -397.0MB). Peak memory consumption was 487.8MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,771 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:57:51,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.88ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:57:51,771 INFO L158 Benchmark]: Boogie Preprocessor took 66.96ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,772 INFO L158 Benchmark]: RCFGBuilder took 521.67ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.6MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,772 INFO L158 Benchmark]: TraceAbstraction took 17900.15ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 56.1MB in the beginning and 507.9MB in the end (delta: -451.7MB). Peak memory consumption was 429.1MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,772 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 1.0GB. Free memory was 507.9MB in the beginning and 507.6MB in the end (delta: 332.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:57:51,773 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.88ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.96ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 521.67ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 56.6MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17900.15ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 56.1MB in the beginning and 507.9MB in the end (delta: -451.7MB). Peak memory consumption was 429.1MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 1.0GB. Free memory was 507.9MB in the beginning and 507.6MB in the end (delta: 332.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] unsigned char last_1_WrapperStruct00_var_1_5 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_5=0] [L131] isInitial = 1 [L132] FCALL initially() [L134] CALL updateLastVariables() [L124] EXPR WrapperStruct00.var_1_5 [L124] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] RET updateVariables() [L136] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] EXPR WrapperStruct00.var_1_1 [L68] EXPR WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] COND FALSE !(WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) [L71] EXPR WrapperStruct00.var_1_3 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] COND TRUE WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] signed long int stepLocal_1 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1))); [L77] EXPR WrapperStruct00.var_1_17 [L77] signed char stepLocal_0 = WrapperStruct00.var_1_17; [L78] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0, stepLocal_1=191] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) [L127] EXPR WrapperStruct00.var_1_5 [L127] EXPR WrapperStruct00.var_1_2 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) [L127] EXPR WrapperStruct00.var_1_1 [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_15 [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127-L128] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 25, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1510 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1505 mSDsluCounter, 13459 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9660 mSDsCounter, 432 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3944 IncrementalHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 432 mSolverCounterUnsat, 3799 mSDtfsCounter, 3944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=24, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 633 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 5176 NumberOfCodeBlocks, 5176 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4964 ConstructedInterpolants, 0 QuantifiedInterpolants, 7576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2341 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 28 InterpolantComputations, 24 PerfectInterpolantSequences, 28094/28336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:57:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:57:53,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:57:53,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:57:53,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:57:53,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:57:53,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:57:53,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:57:53,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:57:53,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:57:53,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:57:53,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:57:53,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:57:53,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:57:53,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:57:53,949 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:57:53,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:57:53,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:57:53,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:53,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:57:53,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:53,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:57:53,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:57:53,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:57:53,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:57:53,953 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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2025-01-09 15:57:54,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:57:54,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:57:54,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:57:54,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:57:54,267 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:57:54,268 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-34.i [2025-01-09 15:57:55,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dbdbc345/956d06d3982d465da2ec4dbafa0b483c/FLAG24f9e963f [2025-01-09 15:57:55,672 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:57:55,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-01-09 15:57:55,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dbdbc345/956d06d3982d465da2ec4dbafa0b483c/FLAG24f9e963f [2025-01-09 15:57:55,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dbdbc345/956d06d3982d465da2ec4dbafa0b483c [2025-01-09 15:57:55,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:57:55,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:57:55,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:57:55,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:57:55,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:57:55,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:55" (1/1) ... [2025-01-09 15:57:55,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ead517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:55, skipping insertion in model container [2025-01-09 15:57:55,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:55" (1/1) ... [2025-01-09 15:57:55,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:57:55,857 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-34.i[916,929] [2025-01-09 15:57:55,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:57:55,930 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:57:55,941 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-34.i[916,929] [2025-01-09 15:57:55,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:57:56,001 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:57:56,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56 WrapperNode [2025-01-09 15:57:56,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:57:56,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:57:56,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:57:56,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:57:56,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,064 INFO L138 Inliner]: procedures = 31, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-01-09 15:57:56,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:57:56,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:57:56,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:57:56,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:57:56,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,104 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-01-09 15:57:56,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:57:56,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:57:56,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:57:56,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:57:56,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (1/1) ... [2025-01-09 15:57:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:57:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:57:56,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:57:56,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:57:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:57:56,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:57:56,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:57:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:57:56,279 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:57:56,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:58:03,973 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 15:58:03,973 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:58:03,980 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:58:03,980 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:58:03,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:03 BoogieIcfgContainer [2025-01-09 15:58:03,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:58:03,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:58:03,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:58:03,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:58:03,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:57:55" (1/3) ... [2025-01-09 15:58:03,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12efa607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:03, skipping insertion in model container [2025-01-09 15:58:03,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:56" (2/3) ... [2025-01-09 15:58:03,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12efa607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:03, skipping insertion in model container [2025-01-09 15:58:03,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:03" (3/3) ... [2025-01-09 15:58:03,987 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2025-01-09 15:58:03,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:58:03,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:58:04,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:58:04,046 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;@21a71fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:58:04,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:58:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 15:58:04,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:04,062 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:04,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:04,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2123841892, now seen corresponding path program 1 times [2025-01-09 15:58:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387322718] [2025-01-09 15:58:04,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:04,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:04,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:04,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:58:04,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:58:04,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:58:04,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:04,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:04,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:58:04,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-01-09 15:58:04,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:04,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387322718] [2025-01-09 15:58:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387322718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:58:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323716238] [2025-01-09 15:58:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:04,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:58:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:04,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:58:04,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:58:04,522 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:58:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:04,551 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-01-09 15:58:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:58:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-01-09 15:58:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:04,556 INFO L225 Difference]: With dead ends: 232 [2025-01-09 15:58:04,556 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:58:04,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:58:04,563 INFO L435 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:04,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:58:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:58:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-01-09 15:58:04,611 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-01-09 15:58:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:04,612 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-01-09 15:58:04,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 15:58:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-01-09 15:58:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 15:58:04,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:04,614 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:04,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:58:04,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:04,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:04,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -172041414, now seen corresponding path program 1 times [2025-01-09 15:58:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606617907] [2025-01-09 15:58:04,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:04,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:04,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:04,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:04,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:58:04,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 15:58:05,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 15:58:05,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:05,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:05,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:58:05,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:05,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:05,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606617907] [2025-01-09 15:58:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606617907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:05,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:58:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855053943] [2025-01-09 15:58:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:05,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:58:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:05,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:58:05,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:05,173 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:05,202 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-01-09 15:58:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:58:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-01-09 15:58:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:05,204 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:58:05,204 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:58:05,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:05,205 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:05,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:58:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 15:58:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-01-09 15:58:05,212 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2025-01-09 15:58:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-01-09 15:58:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-01-09 15:58:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 15:58:05,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:05,215 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:05,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:58:05,419 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 15:58:05,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash -760766546, now seen corresponding path program 1 times [2025-01-09 15:58:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716847688] [2025-01-09 15:58:05,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:05,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:05,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:05,422 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 15:58:05,424 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 15:58:05,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 15:58:05,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 15:58:05,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:05,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:05,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:58:05,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:05,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:05,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716847688] [2025-01-09 15:58:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716847688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:58:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136978659] [2025-01-09 15:58:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:58:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:58:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:58:05,783 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:05,836 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-01-09 15:58:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:58:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-01-09 15:58:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:05,838 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:58:05,838 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:58:05,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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 15:58:05,839 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:05,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:58:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:58:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-01-09 15:58:05,848 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2025-01-09 15:58:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-01-09 15:58:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-01-09 15:58:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 15:58:05,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:05,853 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:05,866 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 15:58:06,058 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 15:58:06,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash -35370848, now seen corresponding path program 1 times [2025-01-09 15:58:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:06,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742684260] [2025-01-09 15:58:06,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:06,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:06,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:58:06,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 15:58:06,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 15:58:06,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:06,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:06,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:58:06,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:06,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:06,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742684260] [2025-01-09 15:58:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742684260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:58:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677058925] [2025-01-09 15:58:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:58:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:06,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:58:06,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:06,472 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:06,679 INFO L93 Difference]: Finished difference Result 273 states and 392 transitions. [2025-01-09 15:58:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:58:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-01-09 15:58:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:06,684 INFO L225 Difference]: With dead ends: 273 [2025-01-09 15:58:06,684 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 15:58:06,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:06,685 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:06,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:58:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 15:58:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2025-01-09 15:58:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2025-01-09 15:58:06,704 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 175 [2025-01-09 15:58:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:06,704 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2025-01-09 15:58:06,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2025-01-09 15:58:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 15:58:06,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:06,706 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:06,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:58:06,906 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 15:58:06,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:06,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1065136187, now seen corresponding path program 1 times [2025-01-09 15:58:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064704953] [2025-01-09 15:58:06,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:06,911 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 15:58:06,912 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 15:58:06,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 15:58:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 15:58:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:58:07,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:07,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:07,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064704953] [2025-01-09 15:58:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064704953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:58:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527501387] [2025-01-09 15:58:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:07,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:58:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:07,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:58:07,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:07,334 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:07,369 INFO L93 Difference]: Finished difference Result 289 states and 410 transitions. [2025-01-09 15:58:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:58:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-01-09 15:58:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:07,371 INFO L225 Difference]: With dead ends: 289 [2025-01-09 15:58:07,371 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 15:58:07,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:07,372 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:07,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 15:58:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2025-01-09 15:58:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2025-01-09 15:58:07,380 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 177 [2025-01-09 15:58:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2025-01-09 15:58:07,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2025-01-09 15:58:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 15:58:07,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:07,382 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:07,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:58:07,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:07,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash -998937103, now seen corresponding path program 1 times [2025-01-09 15:58:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:07,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963478215] [2025-01-09 15:58:07,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:07,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:07,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:58:07,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 15:58:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 15:58:07,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:07,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:07,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:58:07,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:07,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:07,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963478215] [2025-01-09 15:58:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963478215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:58:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589906157] [2025-01-09 15:58:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:07,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:58:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:07,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:58:07,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:07,929 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:07,958 INFO L93 Difference]: Finished difference Result 259 states and 366 transitions. [2025-01-09 15:58:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:58:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-01-09 15:58:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:07,960 INFO L225 Difference]: With dead ends: 259 [2025-01-09 15:58:07,960 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 15:58:07,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:58:07,961 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:07,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:58:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 15:58:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 15:58:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2025-01-09 15:58:07,966 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2025-01-09 15:58:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:07,967 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2025-01-09 15:58:07,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2025-01-09 15:58:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:58:07,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:07,968 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:07,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:58:08,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:08,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:08,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 949661373, now seen corresponding path program 1 times [2025-01-09 15:58:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553653266] [2025-01-09 15:58:08,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:08,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:08,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:58:08,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:58:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:58:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:08,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:58:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:08,565 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 14 treesize of output 10 [2025-01-09 15:58:08,747 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 21 treesize of output 9 [2025-01-09 15:58:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:09,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:09,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553653266] [2025-01-09 15:58:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553653266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:58:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40138471] [2025-01-09 15:58:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:58:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:58:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:58:09,162 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:11,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:15,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:18,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:19,257 INFO L93 Difference]: Finished difference Result 402 states and 564 transitions. [2025-01-09 15:58:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:58:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:58:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:19,259 INFO L225 Difference]: With dead ends: 402 [2025-01-09 15:58:19,259 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 15:58:19,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:58:19,261 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 140 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:19,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1764 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-01-09 15:58:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 15:58:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 169. [2025-01-09 15:58:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2916666666666667) internal successors, (186), 144 states have internal predecessors, (186), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:58:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 232 transitions. [2025-01-09 15:58:19,277 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 232 transitions. Word has length 180 [2025-01-09 15:58:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 232 transitions. [2025-01-09 15:58:19,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 232 transitions. [2025-01-09 15:58:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:58:19,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:19,280 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:19,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:58:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:19,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:19,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1063919937, now seen corresponding path program 1 times [2025-01-09 15:58:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:19,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229762734] [2025-01-09 15:58:19,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:19,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:19,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:19,487 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:19,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:58:19,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:58:19,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:58:19,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:19,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:19,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:58:19,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:20,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:20,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229762734] [2025-01-09 15:58:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229762734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:58:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429976689] [2025-01-09 15:58:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:20,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:58:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:20,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:58:20,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:58:20,027 INFO L87 Difference]: Start difference. First operand 169 states and 232 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:21,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:25,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:27,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:28,156 INFO L93 Difference]: Finished difference Result 382 states and 520 transitions. [2025-01-09 15:58:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:58:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:58:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:28,161 INFO L225 Difference]: With dead ends: 382 [2025-01-09 15:58:28,161 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 15:58:28,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:58:28,162 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:28,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 628 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-01-09 15:58:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 15:58:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2025-01-09 15:58:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 183 states have internal predecessors, (233), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:58:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 283 transitions. [2025-01-09 15:58:28,176 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 283 transitions. Word has length 180 [2025-01-09 15:58:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 283 transitions. [2025-01-09 15:58:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 283 transitions. [2025-01-09 15:58:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:58:28,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:28,180 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:28,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:58:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:28,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -215943741, now seen corresponding path program 1 times [2025-01-09 15:58:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502730916] [2025-01-09 15:58:28,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:28,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 15:58:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:28,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:28,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 (10)] Waiting until timeout for monitored process [2025-01-09 15:58:28,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:58:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:58:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:28,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 15:58:28,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:28,873 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 14 treesize of output 10 [2025-01-09 15:58:29,238 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 52 treesize of output 19 [2025-01-09 15:58:29,380 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 29 [2025-01-09 15:58:29,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:29,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2025-01-09 15:58:30,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:30,200 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 61 treesize of output 45 [2025-01-09 15:58:30,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:30,686 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 56 treesize of output 55 [2025-01-09 15:58:31,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:31,322 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 63 [2025-01-09 15:58:31,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:31,954 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 66 [2025-01-09 15:58:32,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:32,462 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 65 treesize of output 76 [2025-01-09 15:58:33,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:33,211 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 80 treesize of output 79 [2025-01-09 15:58:33,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:33,860 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 75 treesize of output 89 [2025-01-09 15:58:34,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2025-01-09 15:58:35,596 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 122 treesize of output 94 [2025-01-09 15:58:35,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:58:35,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:35,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 176 [2025-01-09 15:58:35,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2025-01-09 15:58:37,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:37,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 215 treesize of output 107 [2025-01-09 15:58:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 866 proven. 57 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 15:58:37,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:58:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:38,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:38,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502730916] [2025-01-09 15:58:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502730916] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:58:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:58:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2025-01-09 15:58:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559809587] [2025-01-09 15:58:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:58:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:38,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:58:38,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:58:38,031 INFO L87 Difference]: Start difference. First operand 210 states and 283 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:39,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:43,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:43,951 INFO L93 Difference]: Finished difference Result 546 states and 731 transitions. [2025-01-09 15:58:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:58:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:58:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:43,956 INFO L225 Difference]: With dead ends: 546 [2025-01-09 15:58:43,958 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 15:58:43,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:58:43,959 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:43,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 341 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 15:58:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 15:58:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 272. [2025-01-09 15:58:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 244 states have (on average 1.290983606557377) internal successors, (315), 245 states have internal predecessors, (315), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:58:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2025-01-09 15:58:43,973 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 180 [2025-01-09 15:58:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2025-01-09 15:58:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2025-01-09 15:58:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:58:43,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:43,976 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:43,990 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 (10)] Ended with exit code 0 [2025-01-09 15:58:44,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:44,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:44,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1281529279, now seen corresponding path program 1 times [2025-01-09 15:58:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637021094] [2025-01-09 15:58:44,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:44,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:44,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:44,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:58:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:58:44,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:58:44,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:44,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:44,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:58:44,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:44,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:58:44,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637021094] [2025-01-09 15:58:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637021094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:58:44,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:58:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:58:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004038307] [2025-01-09 15:58:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:58:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:44,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:58:44,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:58:44,666 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:47,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:50,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:58:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:58:50,978 INFO L93 Difference]: Finished difference Result 552 states and 738 transitions. [2025-01-09 15:58:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:58:50,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-01-09 15:58:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:58:50,981 INFO L225 Difference]: With dead ends: 552 [2025-01-09 15:58:50,984 INFO L226 Difference]: Without dead ends: 283 [2025-01-09 15:58:50,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:58:50,985 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:58:50,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 603 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-09 15:58:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-09 15:58:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 243. [2025-01-09 15:58:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.283720930232558) internal successors, (276), 216 states have internal predecessors, (276), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:58:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 326 transitions. [2025-01-09 15:58:50,991 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 326 transitions. Word has length 180 [2025-01-09 15:58:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:58:50,992 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 326 transitions. [2025-01-09 15:58:50,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 15:58:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 326 transitions. [2025-01-09 15:58:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:58:50,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:58:50,993 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:58:51,005 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 (11)] Ended with exit code 0 [2025-01-09 15:58:51,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:51,193 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:58:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:58:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1170259653, now seen corresponding path program 1 times [2025-01-09 15:58:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:58:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161095384] [2025-01-09 15:58:51,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:58:51,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:58:51,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:58:51,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:58:51,199 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 (12)] Waiting until timeout for monitored process [2025-01-09 15:58:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:58:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:58:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:58:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:58:51,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:58:51,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:58:51,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:58:51,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:58:51,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:51,893 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 52 treesize of output 28 [2025-01-09 15:58:51,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:51,988 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 36 treesize of output 38 [2025-01-09 15:58:52,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:52,229 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 46 treesize of output 51 [2025-01-09 15:58:52,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:52,621 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 56 treesize of output 64 [2025-01-09 15:58:52,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:52,994 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 66 treesize of output 77 [2025-01-09 15:58:53,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:53,522 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 81 treesize of output 80 [2025-01-09 15:58:53,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:53,930 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 81 treesize of output 80 [2025-01-09 15:58:54,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:54,308 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 81 treesize of output 80 [2025-01-09 15:58:54,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:54,675 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 76 treesize of output 90 [2025-01-09 15:58:55,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:55,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2025-01-09 15:58:55,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:55,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2025-01-09 15:58:56,702 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 133 treesize of output 103 [2025-01-09 15:58:56,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:58:56,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:56,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 195 [2025-01-09 15:58:56,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 73 [2025-01-09 15:58:58,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:58:58,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 103 [2025-01-09 15:58:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 804 proven. 63 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 15:58:58,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:58:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:58:58,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:58:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161095384] [2025-01-09 15:58:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161095384] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:58:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:58:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2025-01-09 15:58:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365173477] [2025-01-09 15:58:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:58:58,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:58:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:58:58,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:58:58,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:58:58,832 INFO L87 Difference]: Start difference. First operand 243 states and 326 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)