./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:14:17,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:14:17,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:14:17,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:14:17,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:14:17,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:14:17,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:14:17,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:14:17,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:14:17,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:14:17,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:14:17,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:14:17,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:14:17,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:14:17,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:14:17,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:14:17,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:14:17,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:14:17,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:14:17,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:14:17,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:14:17,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:14:17,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:14:17,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:17,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:17,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:17,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:17,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:14:17,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:17,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:14:17,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:14:17,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:14:17,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:14:17,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:14:17,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:14:17,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:14:17,459 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2025-01-09 16:14:17,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:14:17,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:14:17,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:14:17,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:14:17,742 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:14:17,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2025-01-09 16:14:19,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/643bb8acb/d2824da939d14aaf84c83fff0e188cef/FLAG20b73f10f [2025-01-09 16:14:19,368 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:14:19,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2025-01-09 16:14:19,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/643bb8acb/d2824da939d14aaf84c83fff0e188cef/FLAG20b73f10f [2025-01-09 16:14:19,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/643bb8acb/d2824da939d14aaf84c83fff0e188cef [2025-01-09 16:14:19,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:14:19,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:14:19,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:19,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:14:19,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:14:19,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:19,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6f7ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19, skipping insertion in model container [2025-01-09 16:14:19,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:19,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:14:19,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2025-01-09 16:14:19,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:19,876 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:14:19,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2025-01-09 16:14:19,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:14:19,943 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:14:19,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19 WrapperNode [2025-01-09 16:14:19,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:14:19,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:19,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:14:19,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:14:19,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:19,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:19,993 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2025-01-09 16:14:19,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:14:19,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:14:19,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:14:19,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:14:20,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,022 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:14:20,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:14:20,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:14:20,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:14:20,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:14:20,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (1/1) ... [2025-01-09 16:14:20,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:14:20,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:20,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:14:20,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:14:20,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:14:20,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:14:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:14:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:14:20,238 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:14:20,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:14:20,771 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-01-09 16:14:20,771 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:14:20,782 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:14:20,782 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:14:20,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:20 BoogieIcfgContainer [2025-01-09 16:14:20,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:14:20,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:14:20,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:14:20,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:14:20,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:14:19" (1/3) ... [2025-01-09 16:14:20,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a554e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:20, skipping insertion in model container [2025-01-09 16:14:20,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:14:19" (2/3) ... [2025-01-09 16:14:20,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a554e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:14:20, skipping insertion in model container [2025-01-09 16:14:20,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:14:20" (3/3) ... [2025-01-09 16:14:20,794 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2025-01-09 16:14:20,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:14:20,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-70.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:14:20,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:14:20,872 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;@785a0727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:14:20,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:14:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:14:20,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:20,885 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:20,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:20,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1165450814, now seen corresponding path program 1 times [2025-01-09 16:14:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958454607] [2025-01-09 16:14:20,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:21,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:21,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:21,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:14:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:21,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958454607] [2025-01-09 16:14:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958454607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:21,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178856742] [2025-01-09 16:14:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:21,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:21,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:14:21,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:21,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:21,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:21,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:21,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:14:21,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:14:21,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178856742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:14:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303540742] [2025-01-09 16:14:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:21,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:14:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:21,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:14:21,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:14:21,620 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:21,650 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2025-01-09 16:14:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:14:21,652 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 16:14:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:21,658 INFO L225 Difference]: With dead ends: 214 [2025-01-09 16:14:21,658 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 16:14:21,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:14:21,664 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:21,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 16:14:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 16:14:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-01-09 16:14:21,701 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2025-01-09 16:14:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-01-09 16:14:21,702 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-01-09 16:14:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:14:21,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:21,706 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:21,715 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 16:14:21,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:14:21,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:21,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1154354258, now seen corresponding path program 1 times [2025-01-09 16:14:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366993297] [2025-01-09 16:14:21,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:21,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:22,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:22,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 16:14:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366993297] [2025-01-09 16:14:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366993297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137021285] [2025-01-09 16:14:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:22,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:22,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:14:22,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:22,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:22,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:22,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:14:22,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:22,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137021285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:14:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324190364] [2025-01-09 16:14:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:22,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:22,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:22,715 INFO L87 Difference]: Start difference. First operand 107 states and 155 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:22,765 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2025-01-09 16:14:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:22,765 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-01-09 16:14:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:22,766 INFO L225 Difference]: With dead ends: 214 [2025-01-09 16:14:22,767 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:14:22,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:22,768 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:22,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:14:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 16:14:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 16:14:22,780 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2025-01-09 16:14:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 16:14:22,782 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 16:14:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:14:22,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:22,784 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:22,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:14:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:22,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1365605676, now seen corresponding path program 1 times [2025-01-09 16:14:22,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565267365] [2025-01-09 16:14:22,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:23,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:23,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 16:14:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565267365] [2025-01-09 16:14:23,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565267365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691165816] [2025-01-09 16:14:23,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:23,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:23,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:14:23,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:23,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:23,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:23,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:14:23,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:23,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691165816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:23,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:23,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:14:23,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104291120] [2025-01-09 16:14:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:23,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:23,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:23,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:23,532 INFO L87 Difference]: Start difference. First operand 109 states and 157 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:23,579 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-01-09 16:14:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:23,579 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-01-09 16:14:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:23,582 INFO L225 Difference]: With dead ends: 218 [2025-01-09 16:14:23,582 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 16:14:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:23,584 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:23,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 16:14:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 16:14:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 16:14:23,597 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2025-01-09 16:14:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:23,598 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 16:14:23,598 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 16:14:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:14:23,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:23,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:23,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:14:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:23,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:23,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1363758634, now seen corresponding path program 1 times [2025-01-09 16:14:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163974865] [2025-01-09 16:14:23,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:23,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:23,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:23,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:23,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 16:14:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163974865] [2025-01-09 16:14:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163974865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976877935] [2025-01-09 16:14:24,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:24,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:14:24,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:14:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:14:24,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:24,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:14:24,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:24,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976877935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:14:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339066072] [2025-01-09 16:14:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:24,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:24,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:24,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:14:24,306 INFO L87 Difference]: Start difference. First operand 111 states and 159 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:24,334 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2025-01-09 16:14:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:24,337 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-01-09 16:14:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:24,338 INFO L225 Difference]: With dead ends: 221 [2025-01-09 16:14:24,338 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 16:14:24,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 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 16:14:24,339 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 16:14:24,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 16:14:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 16:14:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-09 16:14:24,357 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 116 [2025-01-09 16:14:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-09 16:14:24,358 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-09 16:14:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:14:24,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:24,362 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:24,371 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 16:14:24,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:24,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:24,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 362096623, now seen corresponding path program 1 times [2025-01-09 16:14:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658035889] [2025-01-09 16:14:24,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:24,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:14:24,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:14:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658035889] [2025-01-09 16:14:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658035889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:14:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241129836] [2025-01-09 16:14:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:14:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:25,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:14:25,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:14:25,017 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:25,201 INFO L93 Difference]: Finished difference Result 239 states and 343 transitions. [2025-01-09 16:14:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:14:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 16:14:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:25,204 INFO L225 Difference]: With dead ends: 239 [2025-01-09 16:14:25,204 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 16:14:25,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:14:25,205 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:25,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 486 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:14:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 16:14:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2025-01-09 16:14:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-01-09 16:14:25,216 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2025-01-09 16:14:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:25,217 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-01-09 16:14:25,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-01-09 16:14:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:14:25,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:25,219 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:25,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:14:25,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:25,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 564684847, now seen corresponding path program 1 times [2025-01-09 16:14:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040322133] [2025-01-09 16:14:25,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:25,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:14:25,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:14:25,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:25,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:25,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040322133] [2025-01-09 16:14:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040322133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:25,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:25,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:14:25,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822379037] [2025-01-09 16:14:25,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:25,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:14:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:25,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:14:25,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:25,980 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:26,263 INFO L93 Difference]: Finished difference Result 236 states and 335 transitions. [2025-01-09 16:14:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:14:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 16:14:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:26,265 INFO L225 Difference]: With dead ends: 236 [2025-01-09 16:14:26,265 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 16:14:26,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:14:26,266 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:26,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 417 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:14:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 16:14:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2025-01-09 16:14:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2025-01-09 16:14:26,277 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2025-01-09 16:14:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:26,277 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2025-01-09 16:14:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2025-01-09 16:14:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:14:26,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:26,279 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:14:26,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:26,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1124258895, now seen corresponding path program 1 times [2025-01-09 16:14:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249630003] [2025-01-09 16:14:26,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:26,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:14:26,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:14:26,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:26,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249630003] [2025-01-09 16:14:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249630003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:14:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570058024] [2025-01-09 16:14:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:14:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:26,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:14:26,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:26,980 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:27,355 INFO L93 Difference]: Finished difference Result 281 states and 393 transitions. [2025-01-09 16:14:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:14:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 16:14:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:27,357 INFO L225 Difference]: With dead ends: 281 [2025-01-09 16:14:27,357 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:14:27,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:14:27,358 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 287 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:27,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 476 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:14:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:14:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2025-01-09 16:14:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2025-01-09 16:14:27,377 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 118 [2025-01-09 16:14:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:27,377 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2025-01-09 16:14:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2025-01-09 16:14:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:14:27,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:27,379 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:14:27,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2102005900, now seen corresponding path program 1 times [2025-01-09 16:14:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616097337] [2025-01-09 16:14:27,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:14:27,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:14:27,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616097337] [2025-01-09 16:14:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616097337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:27,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:14:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103895252] [2025-01-09 16:14:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:27,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:14:27,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:27,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:14:27,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:14:27,661 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:27,836 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2025-01-09 16:14:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:14:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 16:14:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:27,838 INFO L225 Difference]: With dead ends: 295 [2025-01-09 16:14:27,838 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 16:14:27,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:14:27,839 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:27,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:14:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 16:14:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2025-01-09 16:14:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 119 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2025-01-09 16:14:27,852 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 119 [2025-01-09 16:14:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2025-01-09 16:14:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2025-01-09 16:14:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:14:27,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:27,853 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:14:27,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -188975028, now seen corresponding path program 1 times [2025-01-09 16:14:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910114585] [2025-01-09 16:14:27,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:27,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:14:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:14:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 16:14:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910114585] [2025-01-09 16:14:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910114585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:14:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611406257] [2025-01-09 16:14:28,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:28,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:14:28,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:14:28,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:14:28,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:14:28,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:14:28,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:28,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:28,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:14:28,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:14:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:28,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:14:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611406257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:28,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:14:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:14:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388734900] [2025-01-09 16:14:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:28,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:14:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:28,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:14:28,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:14:28,331 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:28,375 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2025-01-09 16:14:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:14:28,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 16:14:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:28,377 INFO L225 Difference]: With dead ends: 266 [2025-01-09 16:14:28,377 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 16:14:28,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 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 16:14:28,378 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:28,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:14:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 16:14:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 16:14:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2025-01-09 16:14:28,388 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 119 [2025-01-09 16:14:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:28,388 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2025-01-09 16:14:28,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2025-01-09 16:14:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 16:14:28,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:28,390 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:28,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:14:28,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:14:28,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:28,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -606764842, now seen corresponding path program 1 times [2025-01-09 16:14:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138680115] [2025-01-09 16:14:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:28,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 16:14:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 16:14:28,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:28,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:28,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:28,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138680115] [2025-01-09 16:14:28,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138680115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:14:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407814813] [2025-01-09 16:14:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:28,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:14:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:28,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:14:28,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:28,812 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:28,977 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2025-01-09 16:14:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:14:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-01-09 16:14:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:28,979 INFO L225 Difference]: With dead ends: 269 [2025-01-09 16:14:28,979 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 16:14:28,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:14:28,980 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:28,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 357 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:14:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 16:14:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 16:14:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2025-01-09 16:14:28,989 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 120 [2025-01-09 16:14:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2025-01-09 16:14:28,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2025-01-09 16:14:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:28,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:28,992 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:14:28,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 532794863, now seen corresponding path program 1 times [2025-01-09 16:14:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275029299] [2025-01-09 16:14:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:29,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:29,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:29,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275029299] [2025-01-09 16:14:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275029299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:14:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646367757] [2025-01-09 16:14:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:30,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:14:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:30,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:14:30,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:14:30,091 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:31,113 INFO L93 Difference]: Finished difference Result 344 states and 469 transitions. [2025-01-09 16:14:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:14:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-01-09 16:14:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:31,115 INFO L225 Difference]: With dead ends: 344 [2025-01-09 16:14:31,115 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 16:14:31,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:14:31,116 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 272 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:31,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 892 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:14:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 16:14:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 155. [2025-01-09 16:14:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2025-01-09 16:14:31,129 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 122 [2025-01-09 16:14:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2025-01-09 16:14:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2025-01-09 16:14:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:31,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:31,130 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:14:31,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1553863217, now seen corresponding path program 1 times [2025-01-09 16:14:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172260949] [2025-01-09 16:14:31,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:31,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:31,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:31,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172260949] [2025-01-09 16:14:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172260949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:33,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 16:14:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785347589] [2025-01-09 16:14:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:33,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:14:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:33,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:14:33,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:14:33,742 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:35,981 INFO L93 Difference]: Finished difference Result 440 states and 596 transitions. [2025-01-09 16:14:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:14:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 16:14:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:35,984 INFO L225 Difference]: With dead ends: 440 [2025-01-09 16:14:35,984 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 16:14:35,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-01-09 16:14:35,985 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 441 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:35,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1135 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 16:14:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 16:14:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 185. [2025-01-09 16:14:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 171 states have internal predecessors, (228), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 252 transitions. [2025-01-09 16:14:36,000 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 252 transitions. Word has length 122 [2025-01-09 16:14:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:36,001 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 252 transitions. [2025-01-09 16:14:36,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:14:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2025-01-09 16:14:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:36,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:36,002 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:36,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:14:36,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1838944399, now seen corresponding path program 1 times [2025-01-09 16:14:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617920472] [2025-01-09 16:14:36,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:36,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:36,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:36,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:36,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617920472] [2025-01-09 16:14:36,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617920472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:36,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:36,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:14:36,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249714479] [2025-01-09 16:14:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:36,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:14:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:36,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:14:36,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:14:36,630 INFO L87 Difference]: Start difference. First operand 185 states and 252 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:37,109 INFO L93 Difference]: Finished difference Result 428 states and 580 transitions. [2025-01-09 16:14:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:14:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-01-09 16:14:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:37,111 INFO L225 Difference]: With dead ends: 428 [2025-01-09 16:14:37,111 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 16:14:37,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:14:37,112 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 235 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:37,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 618 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:14:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 16:14:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 171. [2025-01-09 16:14:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 157 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2025-01-09 16:14:37,129 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 122 [2025-01-09 16:14:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:37,129 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2025-01-09 16:14:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:14:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2025-01-09 16:14:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:37,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:37,131 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:14:37,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1234394737, now seen corresponding path program 1 times [2025-01-09 16:14:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099123572] [2025-01-09 16:14:37,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:37,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:37,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:37,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:37,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099123572] [2025-01-09 16:14:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099123572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:14:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083676151] [2025-01-09 16:14:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:39,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:14:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:39,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:14:39,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:14:39,613 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:14:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:41,174 INFO L93 Difference]: Finished difference Result 407 states and 549 transitions. [2025-01-09 16:14:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:14:41,174 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2025-01-09 16:14:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:41,177 INFO L225 Difference]: With dead ends: 407 [2025-01-09 16:14:41,177 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 16:14:41,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:14:41,178 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 603 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:41,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1059 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:14:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 16:14:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2025-01-09 16:14:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 220 states have internal predecessors, (289), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:14:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 317 transitions. [2025-01-09 16:14:41,202 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 317 transitions. Word has length 122 [2025-01-09 16:14:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 317 transitions. [2025-01-09 16:14:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:14:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 317 transitions. [2025-01-09 16:14:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:41,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:41,207 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:41,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:14:41,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:41,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2039504205, now seen corresponding path program 1 times [2025-01-09 16:14:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760461720] [2025-01-09 16:14:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:41,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:41,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:42,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760461720] [2025-01-09 16:14:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760461720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:42,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:14:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124044553] [2025-01-09 16:14:42,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:14:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:42,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:14:42,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:14:42,645 INFO L87 Difference]: Start difference. First operand 236 states and 317 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:14:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:43,280 INFO L93 Difference]: Finished difference Result 404 states and 546 transitions. [2025-01-09 16:14:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:14:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2025-01-09 16:14:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:43,281 INFO L225 Difference]: With dead ends: 404 [2025-01-09 16:14:43,281 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 16:14:43,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:14:43,283 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 131 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:43,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 586 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:14:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 16:14:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-01-09 16:14:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 156 states have internal predecessors, (206), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2025-01-09 16:14:43,301 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 122 [2025-01-09 16:14:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:43,301 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2025-01-09 16:14:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:14:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2025-01-09 16:14:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:43,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:43,303 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:14:43,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1137344525, now seen corresponding path program 1 times [2025-01-09 16:14:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835860835] [2025-01-09 16:14:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:43,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:43,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:43,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:54,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:54,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835860835] [2025-01-09 16:14:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835860835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:54,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:14:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174291659] [2025-01-09 16:14:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:14:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:54,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:14:54,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:14:54,756 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:14:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:57,694 INFO L93 Difference]: Finished difference Result 442 states and 594 transitions. [2025-01-09 16:14:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:14:57,695 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2025-01-09 16:14:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:57,696 INFO L225 Difference]: With dead ends: 442 [2025-01-09 16:14:57,696 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 16:14:57,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:14:57,697 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 508 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:57,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1173 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 16:14:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 16:14:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 182. [2025-01-09 16:14:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 168 states have internal predecessors, (223), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:14:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2025-01-09 16:14:57,718 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 122 [2025-01-09 16:14:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:14:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2025-01-09 16:14:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:14:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2025-01-09 16:14:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:14:57,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:14:57,722 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:14:57,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:14:57,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:14:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:14:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -116276171, now seen corresponding path program 1 times [2025-01-09 16:14:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:14:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485433427] [2025-01-09 16:14:57,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:14:57,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:14:57,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:14:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:14:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:14:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:14:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:14:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:14:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485433427] [2025-01-09 16:14:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485433427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:14:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:14:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:14:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615655863] [2025-01-09 16:14:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:14:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:14:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:14:59,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:14:59,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:14:59,289 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:14:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:14:59,979 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2025-01-09 16:14:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:14:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2025-01-09 16:14:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:14:59,981 INFO L225 Difference]: With dead ends: 417 [2025-01-09 16:14:59,981 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 16:14:59,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:14:59,982 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 319 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:14:59,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 651 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:14:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 16:15:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2025-01-09 16:15:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 219 states have internal predecessors, (285), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 313 transitions. [2025-01-09 16:15:00,004 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 313 transitions. Word has length 122 [2025-01-09 16:15:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:00,004 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 313 transitions. [2025-01-09 16:15:00,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:15:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 313 transitions. [2025-01-09 16:15:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 16:15:00,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:00,005 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:00,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:15:00,006 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:00,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1272599010, now seen corresponding path program 1 times [2025-01-09 16:15:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589179015] [2025-01-09 16:15:00,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:00,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 16:15:00,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 16:15:00,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:00,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589179015] [2025-01-09 16:15:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589179015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:00,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:15:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493752248] [2025-01-09 16:15:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:15:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:15:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:15:00,291 INFO L87 Difference]: Start difference. First operand 235 states and 313 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:00,636 INFO L93 Difference]: Finished difference Result 476 states and 635 transitions. [2025-01-09 16:15:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:15:00,637 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-01-09 16:15:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:00,639 INFO L225 Difference]: With dead ends: 476 [2025-01-09 16:15:00,639 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 16:15:00,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:15:00,640 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:00,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 567 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:15:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 16:15:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2025-01-09 16:15:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 221 states have internal predecessors, (285), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 313 transitions. [2025-01-09 16:15:00,660 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 313 transitions. Word has length 123 [2025-01-09 16:15:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:00,660 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 313 transitions. [2025-01-09 16:15:00,660 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 313 transitions. [2025-01-09 16:15:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:15:00,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:00,661 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:00,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:15:00,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 607241783, now seen corresponding path program 1 times [2025-01-09 16:15:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955085120] [2025-01-09 16:15:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:00,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:15:00,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:15:00,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:00,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955085120] [2025-01-09 16:15:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955085120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:15:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925368214] [2025-01-09 16:15:03,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:03,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:15:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:03,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:15:03,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:15:03,555 INFO L87 Difference]: Start difference. First operand 237 states and 313 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:05,374 INFO L93 Difference]: Finished difference Result 508 states and 669 transitions. [2025-01-09 16:15:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:15:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2025-01-09 16:15:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:05,376 INFO L225 Difference]: With dead ends: 508 [2025-01-09 16:15:05,376 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 16:15:05,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:15:05,377 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 521 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:05,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1053 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:15:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 16:15:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2025-01-09 16:15:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 208 states have internal predecessors, (268), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 296 transitions. [2025-01-09 16:15:05,396 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 296 transitions. Word has length 124 [2025-01-09 16:15:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:05,397 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 296 transitions. [2025-01-09 16:15:05,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 296 transitions. [2025-01-09 16:15:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:15:05,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:05,398 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:05,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:15:05,398 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:05,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 899990265, now seen corresponding path program 1 times [2025-01-09 16:15:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841414067] [2025-01-09 16:15:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:05,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:15:05,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:15:05,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:05,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841414067] [2025-01-09 16:15:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841414067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:09,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:15:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907144099] [2025-01-09 16:15:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:15:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:15:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:15:09,419 INFO L87 Difference]: Start difference. First operand 224 states and 296 transitions. Second operand has 19 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:15:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:11,410 INFO L93 Difference]: Finished difference Result 449 states and 592 transitions. [2025-01-09 16:15:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:15:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 124 [2025-01-09 16:15:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:11,412 INFO L225 Difference]: With dead ends: 449 [2025-01-09 16:15:11,412 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 16:15:11,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:15:11,413 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 330 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:11,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1176 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:15:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 16:15:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2025-01-09 16:15:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.2938144329896908) internal successors, (251), 195 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2025-01-09 16:15:11,455 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 124 [2025-01-09 16:15:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:11,456 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2025-01-09 16:15:11,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:15:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2025-01-09 16:15:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:15:11,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:11,457 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:15:11,457 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2026325961, now seen corresponding path program 1 times [2025-01-09 16:15:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941436679] [2025-01-09 16:15:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:11,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:15:11,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:15:11,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:11,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941436679] [2025-01-09 16:15:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941436679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:11,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:15:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133381886] [2025-01-09 16:15:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:11,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:15:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:11,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:15:11,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:15:11,687 INFO L87 Difference]: Start difference. First operand 211 states and 279 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:11,731 INFO L93 Difference]: Finished difference Result 419 states and 555 transitions. [2025-01-09 16:15:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:15:11,731 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2025-01-09 16:15:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:11,733 INFO L225 Difference]: With dead ends: 419 [2025-01-09 16:15:11,733 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 16:15:11,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:15:11,734 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:11,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:15:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 16:15:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-01-09 16:15:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 194 states have (on average 1.2835051546391754) internal successors, (249), 195 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2025-01-09 16:15:11,755 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 125 [2025-01-09 16:15:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2025-01-09 16:15:11,756 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2025-01-09 16:15:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:15:11,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:11,758 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:11,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:15:11,758 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1741186605, now seen corresponding path program 1 times [2025-01-09 16:15:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053453548] [2025-01-09 16:15:11,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:11,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:15:11,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:15:11,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:11,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053453548] [2025-01-09 16:15:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053453548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:15:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683745914] [2025-01-09 16:15:12,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:12,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:15:12,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:12,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:15:12,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:15:12,276 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:15:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:12,703 INFO L93 Difference]: Finished difference Result 481 states and 629 transitions. [2025-01-09 16:15:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:15:12,704 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 16:15:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:12,707 INFO L225 Difference]: With dead ends: 481 [2025-01-09 16:15:12,707 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 16:15:12,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:15:12,709 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 176 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:12,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 691 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:15:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 16:15:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 233. [2025-01-09 16:15:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 216 states have (on average 1.287037037037037) internal successors, (278), 217 states have internal predecessors, (278), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2025-01-09 16:15:12,743 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 125 [2025-01-09 16:15:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:12,743 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2025-01-09 16:15:12,744 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:15:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2025-01-09 16:15:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:15:12,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:12,745 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:15:12,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1718554351, now seen corresponding path program 1 times [2025-01-09 16:15:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178143428] [2025-01-09 16:15:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:12,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:15:12,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:15:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:16,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178143428] [2025-01-09 16:15:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178143428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:16,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:16,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 16:15:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503404867] [2025-01-09 16:15:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:16,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:15:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:16,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:15:16,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:15:16,044 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:19,230 INFO L93 Difference]: Finished difference Result 635 states and 821 transitions. [2025-01-09 16:15:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 16:15:19,230 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 125 [2025-01-09 16:15:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:19,232 INFO L225 Difference]: With dead ends: 635 [2025-01-09 16:15:19,232 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 16:15:19,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 16:15:19,233 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 827 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:19,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1421 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 16:15:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 16:15:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 254. [2025-01-09 16:15:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 237 states have (on average 1.2869198312236287) internal successors, (305), 238 states have internal predecessors, (305), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2025-01-09 16:15:19,256 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 125 [2025-01-09 16:15:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2025-01-09 16:15:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2025-01-09 16:15:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:15:19,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:19,257 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:19,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:15:19,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1016954477, now seen corresponding path program 1 times [2025-01-09 16:15:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900453660] [2025-01-09 16:15:19,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:15:19,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:15:19,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:19,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900453660] [2025-01-09 16:15:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900453660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:15:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866410419] [2025-01-09 16:15:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:15:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:19,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:15:19,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:15:19,573 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:19,853 INFO L93 Difference]: Finished difference Result 479 states and 629 transitions. [2025-01-09 16:15:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:15:19,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2025-01-09 16:15:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:19,854 INFO L225 Difference]: With dead ends: 479 [2025-01-09 16:15:19,854 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 16:15:19,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:15:19,855 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 139 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:19,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 456 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:15:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 16:15:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-01-09 16:15:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 212 states have internal predecessors, (269), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2025-01-09 16:15:19,876 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 125 [2025-01-09 16:15:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:19,877 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2025-01-09 16:15:19,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2025-01-09 16:15:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:15:19,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:19,880 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:19,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:15:19,880 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:19,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1356514095, now seen corresponding path program 1 times [2025-01-09 16:15:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109671473] [2025-01-09 16:15:19,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:19,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:15:19,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:15:19,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:19,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:22,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:22,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109671473] [2025-01-09 16:15:22,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109671473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:22,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:15:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957098307] [2025-01-09 16:15:22,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:22,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:15:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:22,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:15:22,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:15:22,285 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:23,755 INFO L93 Difference]: Finished difference Result 551 states and 713 transitions. [2025-01-09 16:15:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:15:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 125 [2025-01-09 16:15:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:23,756 INFO L225 Difference]: With dead ends: 551 [2025-01-09 16:15:23,757 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 16:15:23,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:15:23,758 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 532 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:23,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 787 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:15:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 16:15:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 240. [2025-01-09 16:15:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 223 states have (on average 1.2735426008968609) internal successors, (284), 224 states have internal predecessors, (284), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 16:15:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 312 transitions. [2025-01-09 16:15:23,781 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 312 transitions. Word has length 125 [2025-01-09 16:15:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 312 transitions. [2025-01-09 16:15:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 16:15:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2025-01-09 16:15:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 16:15:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:23,783 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:15:23,783 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 946090014, now seen corresponding path program 1 times [2025-01-09 16:15:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212613469] [2025-01-09 16:15:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:23,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 16:15:23,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 16:15:23,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212613469] [2025-01-09 16:15:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212613469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:15:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225403693] [2025-01-09 16:15:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:15:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:15:26,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:15:26,976 INFO L87 Difference]: Start difference. First operand 240 states and 312 transitions. Second operand has 19 states, 17 states have (on average 4.117647058823529) internal successors, (70), 19 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:15:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:28,789 INFO L93 Difference]: Finished difference Result 641 states and 833 transitions. [2025-01-09 16:15:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:15:28,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.117647058823529) internal successors, (70), 19 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-01-09 16:15:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:28,791 INFO L225 Difference]: With dead ends: 641 [2025-01-09 16:15:28,791 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 16:15:28,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:15:28,792 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 195 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:28,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1434 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:15:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 16:15:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 376. [2025-01-09 16:15:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 343 states have (on average 1.2623906705539358) internal successors, (433), 345 states have internal predecessors, (433), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:15:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 489 transitions. [2025-01-09 16:15:28,835 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 489 transitions. Word has length 127 [2025-01-09 16:15:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 489 transitions. [2025-01-09 16:15:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.117647058823529) internal successors, (70), 19 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:15:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 489 transitions. [2025-01-09 16:15:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 16:15:28,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:28,836 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:15:28,837 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:28,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1327566902, now seen corresponding path program 1 times [2025-01-09 16:15:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588779203] [2025-01-09 16:15:28,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:28,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:28,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 16:15:28,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 16:15:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588779203] [2025-01-09 16:15:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588779203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:29,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:29,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:15:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864508433] [2025-01-09 16:15:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:15:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:29,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:15:29,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:15:29,308 INFO L87 Difference]: Start difference. First operand 376 states and 489 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:15:29,954 INFO L93 Difference]: Finished difference Result 754 states and 987 transitions. [2025-01-09 16:15:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:15:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2025-01-09 16:15:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:15:29,956 INFO L225 Difference]: With dead ends: 754 [2025-01-09 16:15:29,956 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 16:15:29,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:15:29,957 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 22 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:15:29,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1000 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:15:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 16:15:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 385. [2025-01-09 16:15:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 352 states have (on average 1.25) internal successors, (440), 354 states have internal predecessors, (440), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:15:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 496 transitions. [2025-01-09 16:15:29,994 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 496 transitions. Word has length 127 [2025-01-09 16:15:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:15:29,994 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 496 transitions. [2025-01-09 16:15:29,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:15:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2025-01-09 16:15:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 16:15:29,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:15:29,996 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:15:29,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:15:29,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:15:29,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:15:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1468115512, now seen corresponding path program 1 times [2025-01-09 16:15:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:15:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847190053] [2025-01-09 16:15:29,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:15:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:15:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 16:15:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 16:15:30,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:15:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:15:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:15:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:15:31,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847190053] [2025-01-09 16:15:31,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847190053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:15:31,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:15:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 16:15:31,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889093541] [2025-01-09 16:15:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:15:31,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:15:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:15:31,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:15:31,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:15:31,515 INFO L87 Difference]: Start difference. First operand 385 states and 496 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)