./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c -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 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:10:15,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:10:15,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:10:15,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:10:15,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:10:15,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:10:15,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:10:15,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:10:15,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:10:15,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:10:15,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:10:15,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:10:15,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:10:15,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:10:15,460 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:10:15,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:10:15,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:10:15,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:10:15,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:10:15,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:10:15,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:15,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:10:15,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:10:15,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:10:15,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:10:15,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:10:15,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:10:15,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:10:15,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:10:15,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:10:15,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:10:15,464 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 -> 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 [2025-02-05 16:10:15,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:10:15,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:10:15,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:10:15,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:10:15,771 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:10:15,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2025-02-05 16:10:17,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a07ffaf/39ab43e22160413cbfeae380f8f1d9f8/FLAG17dc9c01c [2025-02-05 16:10:17,562 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:10:17,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2025-02-05 16:10:17,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a07ffaf/39ab43e22160413cbfeae380f8f1d9f8/FLAG17dc9c01c [2025-02-05 16:10:17,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a07ffaf/39ab43e22160413cbfeae380f8f1d9f8 [2025-02-05 16:10:17,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:10:17,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:10:17,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:17,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:10:17,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:10:17,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:17,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17, skipping insertion in model container [2025-02-05 16:10:17,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:17,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:10:17,899 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c[14698,14711] [2025-02-05 16:10:17,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:17,911 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:10:17,963 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c[14698,14711] [2025-02-05 16:10:17,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:10:17,984 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:10:17,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17 WrapperNode [2025-02-05 16:10:17,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:10:17,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:17,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:10:17,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:10:17,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,038 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2025-02-05 16:10:18,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:10:18,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:10:18,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:10:18,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:10:18,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:10:18,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:10:18,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:10:18,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:10:18,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:10:18,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (1/1) ... [2025-02-05 16:10:18,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:10:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:18,137 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-02-05 16:10:18,141 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-02-05 16:10:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2025-02-05 16:10:18,166 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2025-02-05 16:10:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:10:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2025-02-05 16:10:18,166 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:10:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2025-02-05 16:10:18,167 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2025-02-05 16:10:18,287 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:10:18,289 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:10:18,871 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-05 16:10:18,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:10:18,887 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:10:18,888 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:10:18,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:18 BoogieIcfgContainer [2025-02-05 16:10:18,888 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:10:18,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:10:18,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:10:18,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:10:18,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:10:17" (1/3) ... [2025-02-05 16:10:18,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3d21db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:18, skipping insertion in model container [2025-02-05 16:10:18,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:10:17" (2/3) ... [2025-02-05 16:10:18,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3d21db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:10:18, skipping insertion in model container [2025-02-05 16:10:18,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:10:18" (3/3) ... [2025-02-05 16:10:18,901 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2025-02-05 16:10:18,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:10:18,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c that has 8 procedures, 180 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:10:18,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:10:18,997 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;@5521d69d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:10:18,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:10:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.55) internal successors, (217), 141 states have internal predecessors, (217), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 16:10:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 16:10:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:19,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -26371481, now seen corresponding path program 1 times [2025-02-05 16:10:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-02-05 16:10:19,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 16:10:19,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 16:10:19,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-02-05 16:10:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22327988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:10:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653861892] [2025-02-05 16:10:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:10:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:10:19,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:10:19,374 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.55) internal successors, (217), 141 states have internal predecessors, (217), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,421 INFO L93 Difference]: Finished difference Result 344 states and 558 transitions. [2025-02-05 16:10:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:10:19,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-05 16:10:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,431 INFO L225 Difference]: With dead ends: 344 [2025-02-05 16:10:19,432 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 16:10:19,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-05 16:10:19,443 INFO L435 NwaCegarLoop]: 277 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, 277 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-02-05 16:10:19,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 16:10:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-05 16:10:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.536231884057971) internal successors, (212), 138 states have internal predecessors, (212), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 16:10:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2025-02-05 16:10:19,519 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 28 [2025-02-05 16:10:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2025-02-05 16:10:19,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2025-02-05 16:10:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 16:10:19,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:19,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:19,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:10:19,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2064427770, now seen corresponding path program 1 times [2025-02-05 16:10:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840890728] [2025-02-05 16:10:19,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 16:10:19,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 16:10:19,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:19,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840890728] [2025-02-05 16:10:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840890728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:10:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028954027] [2025-02-05 16:10:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:10:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:19,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:10:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:19,833 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:19,983 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2025-02-05 16:10:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:10:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-05 16:10:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:19,987 INFO L225 Difference]: With dead ends: 453 [2025-02-05 16:10:19,987 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 16:10:19,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:10:19,990 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:19,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1317 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 16:10:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2025-02-05 16:10:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 16:10:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2025-02-05 16:10:20,020 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 28 [2025-02-05 16:10:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:20,020 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2025-02-05 16:10:20,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2025-02-05 16:10:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 16:10:20,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:20,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:10:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:10:20,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:20,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 138857161, now seen corresponding path program 1 times [2025-02-05 16:10:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-02-05 16:10:20,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 16:10:20,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 16:10:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:10:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-02-05 16:10:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546772710] [2025-02-05 16:10:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:20,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:20,373 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:20,457 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2025-02-05 16:10:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-02-05 16:10:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:20,460 INFO L225 Difference]: With dead ends: 341 [2025-02-05 16:10:20,462 INFO L226 Difference]: Without dead ends: 181 [2025-02-05 16:10:20,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:20,465 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 3 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:20,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 758 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-05 16:10:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-02-05 16:10:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 16:10:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 265 transitions. [2025-02-05 16:10:20,483 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 265 transitions. Word has length 39 [2025-02-05 16:10:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:20,484 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 265 transitions. [2025-02-05 16:10:20,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:10:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 265 transitions. [2025-02-05 16:10:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:10:20,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:20,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:20,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:10:20,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:20,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1785982721, now seen corresponding path program 1 times [2025-02-05 16:10:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-02-05 16:10:20,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:20,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:10:20,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:10:20,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:20,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-02-05 16:10:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700576969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:20,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768634381] [2025-02-05 16:10:20,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:20,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:20,609 INFO L87 Difference]: Start difference. First operand 181 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:20,662 INFO L93 Difference]: Finished difference Result 497 states and 738 transitions. [2025-02-05 16:10:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:20,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2025-02-05 16:10:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:20,667 INFO L225 Difference]: With dead ends: 497 [2025-02-05 16:10:20,667 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 16:10:20,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:20,672 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 213 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:20,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 525 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 16:10:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2025-02-05 16:10:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.46) internal successors, (365), 251 states have internal predecessors, (365), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 16:10:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2025-02-05 16:10:20,709 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 55 [2025-02-05 16:10:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:20,710 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2025-02-05 16:10:20,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2025-02-05 16:10:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:20,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:20,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:20,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:10:20,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:20,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1777935203, now seen corresponding path program 1 times [2025-02-05 16:10:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:20,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34037847] [2025-02-05 16:10:20,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:20,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:10:20,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:10:20,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:20,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34037847] [2025-02-05 16:10:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34037847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732414985] [2025-02-05 16:10:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:20,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:20,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:20,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:20,863 INFO L87 Difference]: Start difference. First operand 327 states and 485 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:20,934 INFO L93 Difference]: Finished difference Result 920 states and 1376 transitions. [2025-02-05 16:10:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-05 16:10:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:20,942 INFO L225 Difference]: With dead ends: 920 [2025-02-05 16:10:20,942 INFO L226 Difference]: Without dead ends: 610 [2025-02-05 16:10:20,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:20,945 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 215 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:20,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 547 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-05 16:10:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2025-02-05 16:10:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 455 states have (on average 1.4703296703296704) internal successors, (669), 458 states have internal predecessors, (669), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 16:10:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2025-02-05 16:10:21,014 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 56 [2025-02-05 16:10:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2025-02-05 16:10:21,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2025-02-05 16:10:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:10:21,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:21,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:10:21,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1009480284, now seen corresponding path program 1 times [2025-02-05 16:10:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358156721] [2025-02-05 16:10:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:10:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:10:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:21,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358156721] [2025-02-05 16:10:21,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358156721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757587782] [2025-02-05 16:10:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:21,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:21,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:21,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:21,238 INFO L87 Difference]: Start difference. First operand 604 states and 903 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:21,455 INFO L93 Difference]: Finished difference Result 1295 states and 1932 transitions. [2025-02-05 16:10:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-02-05 16:10:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:21,461 INFO L225 Difference]: With dead ends: 1295 [2025-02-05 16:10:21,461 INFO L226 Difference]: Without dead ends: 708 [2025-02-05 16:10:21,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:21,464 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 369 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:21,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 672 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-02-05 16:10:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 692. [2025-02-05 16:10:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 530 states have (on average 1.4547169811320755) internal successors, (771), 533 states have internal predecessors, (771), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2025-02-05 16:10:21,546 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 56 [2025-02-05 16:10:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:21,546 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2025-02-05 16:10:21,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2025-02-05 16:10:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:10:21,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:21,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:10:21,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1359635410, now seen corresponding path program 1 times [2025-02-05 16:10:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259628687] [2025-02-05 16:10:21,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:21,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:10:21,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:10:21,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:21,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:21,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259628687] [2025-02-05 16:10:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259628687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:10:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114047677] [2025-02-05 16:10:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:21,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:21,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:21,710 INFO L87 Difference]: Start difference. First operand 692 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:21,919 INFO L93 Difference]: Finished difference Result 1299 states and 1932 transitions. [2025-02-05 16:10:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-02-05 16:10:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:21,926 INFO L225 Difference]: With dead ends: 1299 [2025-02-05 16:10:21,926 INFO L226 Difference]: Without dead ends: 712 [2025-02-05 16:10:21,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:21,929 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 369 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:21,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 672 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-02-05 16:10:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 700. [2025-02-05 16:10:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 541 states have internal predecessors, (779), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1027 transitions. [2025-02-05 16:10:22,005 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1027 transitions. Word has length 57 [2025-02-05 16:10:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:22,006 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1027 transitions. [2025-02-05 16:10:22,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1027 transitions. [2025-02-05 16:10:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:10:22,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:22,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:22,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:10:22,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:22,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 167945063, now seen corresponding path program 1 times [2025-02-05 16:10:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950077004] [2025-02-05 16:10:22,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:10:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:10:22,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:22,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950077004] [2025-02-05 16:10:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950077004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270483501] [2025-02-05 16:10:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:22,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:22,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:22,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:22,184 INFO L87 Difference]: Start difference. First operand 700 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:22,374 INFO L93 Difference]: Finished difference Result 1287 states and 1912 transitions. [2025-02-05 16:10:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-02-05 16:10:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:22,381 INFO L225 Difference]: With dead ends: 1287 [2025-02-05 16:10:22,384 INFO L226 Difference]: Without dead ends: 700 [2025-02-05 16:10:22,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:22,390 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 61 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:22,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 666 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-05 16:10:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-02-05 16:10:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4405204460966543) internal successors, (775), 541 states have internal predecessors, (775), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1023 transitions. [2025-02-05 16:10:22,460 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1023 transitions. Word has length 59 [2025-02-05 16:10:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:22,461 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1023 transitions. [2025-02-05 16:10:22,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:10:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1023 transitions. [2025-02-05 16:10:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:10:22,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:22,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:10:22,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:22,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 706798107, now seen corresponding path program 1 times [2025-02-05 16:10:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879989492] [2025-02-05 16:10:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:22,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:10:22,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:10:22,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:22,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879989492] [2025-02-05 16:10:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879989492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22058766] [2025-02-05 16:10:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:22,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:22,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:22,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:22,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:22,742 INFO L87 Difference]: Start difference. First operand 700 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 16:10:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:22,819 INFO L93 Difference]: Finished difference Result 1307 states and 1936 transitions. [2025-02-05 16:10:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:22,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-02-05 16:10:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:22,826 INFO L225 Difference]: With dead ends: 1307 [2025-02-05 16:10:22,828 INFO L226 Difference]: Without dead ends: 720 [2025-02-05 16:10:22,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:22,832 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 770 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-02-05 16:10:22,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-02-05 16:10:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-02-05 16:10:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 554 states have (on average 1.4277978339350181) internal successors, (791), 557 states have internal predecessors, (791), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1039 transitions. [2025-02-05 16:10:22,896 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1039 transitions. Word has length 60 [2025-02-05 16:10:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1039 transitions. [2025-02-05 16:10:22,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 16:10:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1039 transitions. [2025-02-05 16:10:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:10:22,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:22,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:22,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:10:22,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:22,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -784941251, now seen corresponding path program 1 times [2025-02-05 16:10:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426965166] [2025-02-05 16:10:22,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:10:22,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:10:22,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:22,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426965166] [2025-02-05 16:10:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426965166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522365399] [2025-02-05 16:10:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:23,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:23,112 INFO L87 Difference]: Start difference. First operand 720 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:23,202 INFO L93 Difference]: Finished difference Result 1347 states and 1980 transitions. [2025-02-05 16:10:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-02-05 16:10:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:23,209 INFO L225 Difference]: With dead ends: 1347 [2025-02-05 16:10:23,209 INFO L226 Difference]: Without dead ends: 740 [2025-02-05 16:10:23,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:23,212 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:23,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-05 16:10:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2025-02-05 16:10:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 570 states have (on average 1.4157894736842105) internal successors, (807), 573 states have internal predecessors, (807), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1055 transitions. [2025-02-05 16:10:23,267 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1055 transitions. Word has length 68 [2025-02-05 16:10:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:23,267 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1055 transitions. [2025-02-05 16:10:23,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 16:10:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1055 transitions. [2025-02-05 16:10:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:10:23,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:23,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:23,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:10:23,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:23,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -590672733, now seen corresponding path program 1 times [2025-02-05 16:10:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539005617] [2025-02-05 16:10:23,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:23,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:10:23,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:10:23,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:23,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539005617] [2025-02-05 16:10:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539005617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:23,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284572159] [2025-02-05 16:10:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:23,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:23,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:23,459 INFO L87 Difference]: Start difference. First operand 740 states and 1055 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:23,532 INFO L93 Difference]: Finished difference Result 1383 states and 1996 transitions. [2025-02-05 16:10:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-02-05 16:10:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:23,539 INFO L225 Difference]: With dead ends: 1383 [2025-02-05 16:10:23,539 INFO L226 Difference]: Without dead ends: 756 [2025-02-05 16:10:23,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:23,542 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:23,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 766 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-02-05 16:10:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2025-02-05 16:10:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 582 states have (on average 1.407216494845361) internal successors, (819), 585 states have internal predecessors, (819), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1067 transitions. [2025-02-05 16:10:23,590 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1067 transitions. Word has length 76 [2025-02-05 16:10:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:23,590 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1067 transitions. [2025-02-05 16:10:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1067 transitions. [2025-02-05 16:10:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:10:23,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:23,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:23,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:10:23,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1222600996, now seen corresponding path program 1 times [2025-02-05 16:10:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57936798] [2025-02-05 16:10:23,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:23,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:10:23,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:10:23,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:23,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:10:23,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57936798] [2025-02-05 16:10:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57936798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:23,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931170962] [2025-02-05 16:10:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:23,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:23,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:23,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:23,778 INFO L87 Difference]: Start difference. First operand 756 states and 1067 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:23,869 INFO L93 Difference]: Finished difference Result 1419 states and 2036 transitions. [2025-02-05 16:10:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-02-05 16:10:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:23,876 INFO L225 Difference]: With dead ends: 1419 [2025-02-05 16:10:23,876 INFO L226 Difference]: Without dead ends: 776 [2025-02-05 16:10:23,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:23,879 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:23,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-05 16:10:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2025-02-05 16:10:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 598 states have (on average 1.3963210702341138) internal successors, (835), 601 states have internal predecessors, (835), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1083 transitions. [2025-02-05 16:10:23,932 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1083 transitions. Word has length 76 [2025-02-05 16:10:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1083 transitions. [2025-02-05 16:10:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:10:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1083 transitions. [2025-02-05 16:10:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:10:23,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:23,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:23,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:10:23,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:23,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:23,936 INFO L85 PathProgramCache]: Analyzing trace with hash -551241446, now seen corresponding path program 1 times [2025-02-05 16:10:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415822309] [2025-02-05 16:10:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:23,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:10:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:10:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415822309] [2025-02-05 16:10:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415822309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760401469] [2025-02-05 16:10:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:24,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:24,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:24,148 INFO L87 Difference]: Start difference. First operand 776 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:24,225 INFO L93 Difference]: Finished difference Result 1463 states and 2064 transitions. [2025-02-05 16:10:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2025-02-05 16:10:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:24,231 INFO L225 Difference]: With dead ends: 1463 [2025-02-05 16:10:24,232 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 16:10:24,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:24,234 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:24,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 768 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 16:10:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-02-05 16:10:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 618 states have (on average 1.383495145631068) internal successors, (855), 621 states have internal predecessors, (855), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 16:10:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1103 transitions. [2025-02-05 16:10:24,285 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1103 transitions. Word has length 84 [2025-02-05 16:10:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:24,285 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1103 transitions. [2025-02-05 16:10:24,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:10:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1103 transitions. [2025-02-05 16:10:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:10:24,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:24,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:24,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:10:24,288 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:24,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash 292903096, now seen corresponding path program 1 times [2025-02-05 16:10:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:24,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932582759] [2025-02-05 16:10:24,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:24,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:24,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:10:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:10:24,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:10:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932582759] [2025-02-05 16:10:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932582759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280486054] [2025-02-05 16:10:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:24,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:24,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:24,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:24,906 INFO L87 Difference]: Start difference. First operand 800 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:10:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:25,254 INFO L93 Difference]: Finished difference Result 2059 states and 2829 transitions. [2025-02-05 16:10:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-02-05 16:10:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:25,264 INFO L225 Difference]: With dead ends: 2059 [2025-02-05 16:10:25,264 INFO L226 Difference]: Without dead ends: 1372 [2025-02-05 16:10:25,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:25,267 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 197 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:25,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1482 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:10:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-02-05 16:10:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1084. [2025-02-05 16:10:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 829 states have (on average 1.3715319662243668) internal successors, (1137), 834 states have internal predecessors, (1137), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2025-02-05 16:10:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2025-02-05 16:10:25,366 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 87 [2025-02-05 16:10:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2025-02-05 16:10:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 16:10:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2025-02-05 16:10:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:10:25,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:25,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:10:25,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -136512296, now seen corresponding path program 1 times [2025-02-05 16:10:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343941335] [2025-02-05 16:10:25,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:25,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:10:25,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:10:25,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:10:25,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:25,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343941335] [2025-02-05 16:10:25,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343941335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:25,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571482272] [2025-02-05 16:10:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:25,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:25,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:25,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:25,538 INFO L87 Difference]: Start difference. First operand 1084 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:25,634 INFO L93 Difference]: Finished difference Result 2011 states and 2772 transitions. [2025-02-05 16:10:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:25,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-02-05 16:10:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:25,647 INFO L225 Difference]: With dead ends: 2011 [2025-02-05 16:10:25,647 INFO L226 Difference]: Without dead ends: 1108 [2025-02-05 16:10:25,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:25,650 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:25,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 766 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-05 16:10:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-02-05 16:10:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 847 states have (on average 1.3636363636363635) internal successors, (1155), 852 states have internal predecessors, (1155), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2025-02-05 16:10:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1499 transitions. [2025-02-05 16:10:25,751 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1499 transitions. Word has length 91 [2025-02-05 16:10:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:25,752 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1499 transitions. [2025-02-05 16:10:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1499 transitions. [2025-02-05 16:10:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:10:25,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:25,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:10:25,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2110599230, now seen corresponding path program 1 times [2025-02-05 16:10:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18163820] [2025-02-05 16:10:25,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:10:25,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:10:25,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18163820] [2025-02-05 16:10:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18163820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758700163] [2025-02-05 16:10:26,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:26,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:26,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:26,115 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-02-05 16:10:26,116 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-02-05 16:10:26,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:10:26,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:10:26,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:26,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:26,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 16:10:26,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:10:26,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:26,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758700163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:26,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:26,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-02-05 16:10:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529568096] [2025-02-05 16:10:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:10:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:26,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:10:26,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:10:26,444 INFO L87 Difference]: Start difference. First operand 1108 states and 1499 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:26,692 INFO L93 Difference]: Finished difference Result 2377 states and 3341 transitions. [2025-02-05 16:10:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:10:26,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-02-05 16:10:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:26,704 INFO L225 Difference]: With dead ends: 2377 [2025-02-05 16:10:26,705 INFO L226 Difference]: Without dead ends: 1538 [2025-02-05 16:10:26,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:10:26,709 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 140 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 2879 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-02-05 16:10:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1116. [2025-02-05 16:10:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 851 states have (on average 1.354876615746181) internal successors, (1153), 858 states have internal predecessors, (1153), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2025-02-05 16:10:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1501 transitions. [2025-02-05 16:10:26,812 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1501 transitions. Word has length 90 [2025-02-05 16:10:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:26,813 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1501 transitions. [2025-02-05 16:10:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-05 16:10:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1501 transitions. [2025-02-05 16:10:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:10:26,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:26,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:26,848 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-02-05 16:10:27,015 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,SelfDestructingSolverStorable15 [2025-02-05 16:10:27,016 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:27,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1809193859, now seen corresponding path program 1 times [2025-02-05 16:10:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001474508] [2025-02-05 16:10:27,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:27,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:10:27,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:10:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:10:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001474508] [2025-02-05 16:10:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001474508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:27,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614282882] [2025-02-05 16:10:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:27,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:27,192 INFO L87 Difference]: Start difference. First operand 1116 states and 1501 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:10:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:27,402 INFO L93 Difference]: Finished difference Result 2016 states and 2722 transitions. [2025-02-05 16:10:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:27,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2025-02-05 16:10:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:27,411 INFO L225 Difference]: With dead ends: 2016 [2025-02-05 16:10:27,411 INFO L226 Difference]: Without dead ends: 1163 [2025-02-05 16:10:27,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:27,415 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 256 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:27,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1491 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-02-05 16:10:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1121. [2025-02-05 16:10:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 867 states have (on average 1.3471741637831602) internal successors, (1168), 879 states have internal predecessors, (1168), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-05 16:10:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1492 transitions. [2025-02-05 16:10:27,495 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1492 transitions. Word has length 93 [2025-02-05 16:10:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:27,495 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1492 transitions. [2025-02-05 16:10:27,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:10:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1492 transitions. [2025-02-05 16:10:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:10:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:27,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:10:27,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 958566529, now seen corresponding path program 1 times [2025-02-05 16:10:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51881353] [2025-02-05 16:10:27,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:27,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:10:27,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:10:27,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:27,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:10:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51881353] [2025-02-05 16:10:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51881353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425276713] [2025-02-05 16:10:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:28,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:28,019 INFO L87 Difference]: Start difference. First operand 1121 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:28,253 INFO L93 Difference]: Finished difference Result 1997 states and 2669 transitions. [2025-02-05 16:10:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-02-05 16:10:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:28,262 INFO L225 Difference]: With dead ends: 1997 [2025-02-05 16:10:28,263 INFO L226 Difference]: Without dead ends: 1119 [2025-02-05 16:10:28,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:28,265 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 151 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:28,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1607 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-02-05 16:10:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1011. [2025-02-05 16:10:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 784 states have (on average 1.3494897959183674) internal successors, (1058), 794 states have internal predecessors, (1058), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2025-02-05 16:10:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1348 transitions. [2025-02-05 16:10:28,340 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1348 transitions. Word has length 95 [2025-02-05 16:10:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1348 transitions. [2025-02-05 16:10:28,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1348 transitions. [2025-02-05 16:10:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:10:28,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:28,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:28,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:10:28,342 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:28,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 635989907, now seen corresponding path program 1 times [2025-02-05 16:10:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:28,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209850343] [2025-02-05 16:10:28,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:28,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:10:28,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:10:28,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:28,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:28,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:28,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209850343] [2025-02-05 16:10:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209850343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:28,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472893215] [2025-02-05 16:10:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:28,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:28,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:28,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:28,895 INFO L87 Difference]: Start difference. First operand 1011 states and 1348 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:29,329 INFO L93 Difference]: Finished difference Result 1941 states and 2585 transitions. [2025-02-05 16:10:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2025-02-05 16:10:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:29,339 INFO L225 Difference]: With dead ends: 1941 [2025-02-05 16:10:29,340 INFO L226 Difference]: Without dead ends: 1103 [2025-02-05 16:10:29,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:29,343 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 420 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:29,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1481 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:10:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-05 16:10:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1049. [2025-02-05 16:10:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 807 states have (on average 1.3283767038413878) internal successors, (1072), 818 states have internal predecessors, (1072), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2025-02-05 16:10:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1380 transitions. [2025-02-05 16:10:29,439 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1380 transitions. Word has length 96 [2025-02-05 16:10:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:29,440 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1380 transitions. [2025-02-05 16:10:29,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1380 transitions. [2025-02-05 16:10:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:10:29,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:29,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:29,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:10:29,443 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:29,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash -347487727, now seen corresponding path program 1 times [2025-02-05 16:10:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-02-05 16:10:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:10:29,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:10:29,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:29,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:10:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-02-05 16:10:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915349724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110203547] [2025-02-05 16:10:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:29,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:29,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:29,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:29,943 INFO L87 Difference]: Start difference. First operand 1049 states and 1380 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:30,405 INFO L93 Difference]: Finished difference Result 2028 states and 2653 transitions. [2025-02-05 16:10:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:10:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2025-02-05 16:10:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:30,417 INFO L225 Difference]: With dead ends: 2028 [2025-02-05 16:10:30,418 INFO L226 Difference]: Without dead ends: 1165 [2025-02-05 16:10:30,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:30,423 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 409 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1271 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:10:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-02-05 16:10:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1071. [2025-02-05 16:10:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 821 states have (on average 1.313032886723508) internal successors, (1078), 833 states have internal predecessors, (1078), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2025-02-05 16:10:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1392 transitions. [2025-02-05 16:10:30,557 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1392 transitions. Word has length 98 [2025-02-05 16:10:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:30,558 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1392 transitions. [2025-02-05 16:10:30,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:10:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1392 transitions. [2025-02-05 16:10:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:10:30,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:30,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:30,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:10:30,560 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:30,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1879289154, now seen corresponding path program 1 times [2025-02-05 16:10:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845772549] [2025-02-05 16:10:30,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:30,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:10:30,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:10:30,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:30,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845772549] [2025-02-05 16:10:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845772549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:30,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749009046] [2025-02-05 16:10:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:30,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:30,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:30,666 INFO L87 Difference]: Start difference. First operand 1071 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:30,892 INFO L93 Difference]: Finished difference Result 2787 states and 3650 transitions. [2025-02-05 16:10:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-02-05 16:10:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:30,906 INFO L225 Difference]: With dead ends: 2787 [2025-02-05 16:10:30,906 INFO L226 Difference]: Without dead ends: 1980 [2025-02-05 16:10:30,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:30,910 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 200 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:30,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1172 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-02-05 16:10:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1797. [2025-02-05 16:10:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1359 states have (on average 1.3142016188373804) internal successors, (1786), 1379 states have internal predecessors, (1786), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2025-02-05 16:10:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2346 transitions. [2025-02-05 16:10:31,091 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2346 transitions. Word has length 99 [2025-02-05 16:10:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:31,092 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2346 transitions. [2025-02-05 16:10:31,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2346 transitions. [2025-02-05 16:10:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:10:31,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:31,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:31,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:10:31,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:31,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1487507205, now seen corresponding path program 1 times [2025-02-05 16:10:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037861045] [2025-02-05 16:10:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:10:31,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:10:31,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:31,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037861045] [2025-02-05 16:10:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037861045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:31,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858446681] [2025-02-05 16:10:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:31,208 INFO L87 Difference]: Start difference. First operand 1797 states and 2346 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:31,496 INFO L93 Difference]: Finished difference Result 4168 states and 5466 transitions. [2025-02-05 16:10:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:31,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-02-05 16:10:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:31,516 INFO L225 Difference]: With dead ends: 4168 [2025-02-05 16:10:31,516 INFO L226 Difference]: Without dead ends: 2706 [2025-02-05 16:10:31,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:31,524 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 201 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:31,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1206 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2025-02-05 16:10:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2521. [2025-02-05 16:10:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 1895 states have (on average 1.312928759894459) internal successors, (2488), 1923 states have internal predecessors, (2488), 403 states have call successors, (403), 222 states have call predecessors, (403), 222 states have return successors, (403), 375 states have call predecessors, (403), 403 states have call successors, (403) [2025-02-05 16:10:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3294 transitions. [2025-02-05 16:10:31,860 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3294 transitions. Word has length 101 [2025-02-05 16:10:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 3294 transitions. [2025-02-05 16:10:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3294 transitions. [2025-02-05 16:10:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:10:31,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:31,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:31,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:10:31,871 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash 612632039, now seen corresponding path program 1 times [2025-02-05 16:10:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25092501] [2025-02-05 16:10:31,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:31,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:10:31,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:10:31,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:31,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25092501] [2025-02-05 16:10:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25092501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208243836] [2025-02-05 16:10:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:31,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:31,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:31,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:31,997 INFO L87 Difference]: Start difference. First operand 2521 states and 3294 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:32,409 INFO L93 Difference]: Finished difference Result 6454 states and 8473 transitions. [2025-02-05 16:10:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-02-05 16:10:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:32,435 INFO L225 Difference]: With dead ends: 6454 [2025-02-05 16:10:32,436 INFO L226 Difference]: Without dead ends: 4374 [2025-02-05 16:10:32,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:32,443 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 207 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:32,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1192 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2025-02-05 16:10:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 4035. [2025-02-05 16:10:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 2998 states have (on average 1.301200800533689) internal successors, (3901), 3042 states have internal predecessors, (3901), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2025-02-05 16:10:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5245 transitions. [2025-02-05 16:10:32,803 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5245 transitions. Word has length 101 [2025-02-05 16:10:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:32,804 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 5245 transitions. [2025-02-05 16:10:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5245 transitions. [2025-02-05 16:10:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:10:32,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:32,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:32,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:10:32,807 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:32,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash -937211755, now seen corresponding path program 1 times [2025-02-05 16:10:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246908392] [2025-02-05 16:10:32,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:32,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:10:32,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:10:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:32,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246908392] [2025-02-05 16:10:32,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246908392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:32,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:32,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:10:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971190736] [2025-02-05 16:10:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:32,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:10:32,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:32,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:10:32,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:32,860 INFO L87 Difference]: Start difference. First operand 4035 states and 5245 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:33,252 INFO L93 Difference]: Finished difference Result 7749 states and 10121 transitions. [2025-02-05 16:10:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:10:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-02-05 16:10:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:33,300 INFO L225 Difference]: With dead ends: 7749 [2025-02-05 16:10:33,303 INFO L226 Difference]: Without dead ends: 4068 [2025-02-05 16:10:33,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:10:33,316 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 6 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:33,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 489 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2025-02-05 16:10:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 4041. [2025-02-05 16:10:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4041 states, 3004 states have (on average 1.3005992010652463) internal successors, (3907), 3048 states have internal predecessors, (3907), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2025-02-05 16:10:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5251 transitions. [2025-02-05 16:10:33,704 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5251 transitions. Word has length 102 [2025-02-05 16:10:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:33,705 INFO L471 AbstractCegarLoop]: Abstraction has 4041 states and 5251 transitions. [2025-02-05 16:10:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5251 transitions. [2025-02-05 16:10:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:10:33,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:33,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:33,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:10:33,708 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 762584868, now seen corresponding path program 1 times [2025-02-05 16:10:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167659639] [2025-02-05 16:10:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:10:33,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:10:33,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:33,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:33,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:33,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167659639] [2025-02-05 16:10:33,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167659639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:33,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:33,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139736882] [2025-02-05 16:10:33,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:33,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:33,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:33,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:33,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:33,837 INFO L87 Difference]: Start difference. First operand 4041 states and 5251 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:34,242 INFO L93 Difference]: Finished difference Result 7714 states and 10048 transitions. [2025-02-05 16:10:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2025-02-05 16:10:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:34,270 INFO L225 Difference]: With dead ends: 7714 [2025-02-05 16:10:34,270 INFO L226 Difference]: Without dead ends: 3749 [2025-02-05 16:10:34,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:34,284 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 83 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:34,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 749 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2025-02-05 16:10:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3686. [2025-02-05 16:10:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 2732 states have (on average 1.3100292825768667) internal successors, (3579), 2766 states have internal predecessors, (3579), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2025-02-05 16:10:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4819 transitions. [2025-02-05 16:10:34,704 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4819 transitions. Word has length 103 [2025-02-05 16:10:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:34,705 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4819 transitions. [2025-02-05 16:10:34,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4819 transitions. [2025-02-05 16:10:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:10:34,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:34,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:10:34,707 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:34,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1467225330, now seen corresponding path program 1 times [2025-02-05 16:10:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:34,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817404852] [2025-02-05 16:10:34,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:34,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:10:34,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:10:34,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:34,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:10:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:34,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817404852] [2025-02-05 16:10:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817404852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:10:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060411558] [2025-02-05 16:10:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:34,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:10:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:10:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:10:34,848 INFO L87 Difference]: Start difference. First operand 3686 states and 4819 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:35,139 INFO L93 Difference]: Finished difference Result 7175 states and 9401 transitions. [2025-02-05 16:10:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:10:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-02-05 16:10:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:35,162 INFO L225 Difference]: With dead ends: 7175 [2025-02-05 16:10:35,163 INFO L226 Difference]: Without dead ends: 3608 [2025-02-05 16:10:35,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:10:35,173 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 64 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:35,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 759 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2025-02-05 16:10:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 2781. [2025-02-05 16:10:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2061 states have (on average 1.304221251819505) internal successors, (2688), 2080 states have internal predecessors, (2688), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2025-02-05 16:10:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3626 transitions. [2025-02-05 16:10:35,418 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3626 transitions. Word has length 104 [2025-02-05 16:10:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3626 transitions. [2025-02-05 16:10:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 16:10:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3626 transitions. [2025-02-05 16:10:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 16:10:35,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:35,425 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:35,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:10:35,426 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1068673490, now seen corresponding path program 1 times [2025-02-05 16:10:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977543597] [2025-02-05 16:10:35,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:10:35,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:10:35,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:35,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977543597] [2025-02-05 16:10:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977543597] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157233487] [2025-02-05 16:10:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:35,791 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-02-05 16:10:35,817 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-02-05 16:10:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 16:10:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 16:10:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:36,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:10:36,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 16:10:36,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:10:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157233487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:10:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-02-05 16:10:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319935814] [2025-02-05 16:10:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:36,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:10:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:36,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:10:36,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:10:36,115 INFO L87 Difference]: Start difference. First operand 2781 states and 3626 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 16:10:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:36,323 INFO L93 Difference]: Finished difference Result 5232 states and 6863 transitions. [2025-02-05 16:10:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:10:36,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2025-02-05 16:10:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:36,342 INFO L225 Difference]: With dead ends: 5232 [2025-02-05 16:10:36,342 INFO L226 Difference]: Without dead ends: 2610 [2025-02-05 16:10:36,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:10:36,352 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:36,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1024 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:10:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2025-02-05 16:10:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2594. [2025-02-05 16:10:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 1919 states have (on average 1.3006774361646691) internal successors, (2496), 1936 states have internal predecessors, (2496), 440 states have call successors, (440), 234 states have call predecessors, (440), 234 states have return successors, (440), 423 states have call predecessors, (440), 440 states have call successors, (440) [2025-02-05 16:10:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3376 transitions. [2025-02-05 16:10:36,586 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3376 transitions. Word has length 154 [2025-02-05 16:10:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 2594 states and 3376 transitions. [2025-02-05 16:10:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 16:10:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3376 transitions. [2025-02-05 16:10:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 16:10:36,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:36,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:36,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:10:36,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 16:10:36,794 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1296170498, now seen corresponding path program 1 times [2025-02-05 16:10:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338915851] [2025-02-05 16:10:36,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:36,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:10:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:10:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:37,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338915851] [2025-02-05 16:10:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338915851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:37,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305529176] [2025-02-05 16:10:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:37,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:37,483 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-02-05 16:10:37,486 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-02-05 16:10:37,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 16:10:37,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 16:10:37,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:37,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:10:37,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:38,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305529176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:38,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2025-02-05 16:10:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737609828] [2025-02-05 16:10:38,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:10:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:38,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:10:38,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:10:38,479 INFO L87 Difference]: Start difference. First operand 2594 states and 3376 transitions. Second operand has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-02-05 16:10:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:43,839 INFO L93 Difference]: Finished difference Result 7577 states and 9895 transitions. [2025-02-05 16:10:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 16:10:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 156 [2025-02-05 16:10:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:43,867 INFO L225 Difference]: With dead ends: 7577 [2025-02-05 16:10:43,867 INFO L226 Difference]: Without dead ends: 5225 [2025-02-05 16:10:43,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1040, Invalid=6100, Unknown=0, NotChecked=0, Total=7140 [2025-02-05 16:10:43,880 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 2513 mSDsluCounter, 6458 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 7102 SdHoareTripleChecker+Invalid, 4146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 7102 Invalid, 4146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [926 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 16:10:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2025-02-05 16:10:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4535. [2025-02-05 16:10:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3355 states have (on average 1.3046199701937407) internal successors, (4377), 3384 states have internal predecessors, (4377), 765 states have call successors, (765), 414 states have call predecessors, (765), 414 states have return successors, (765), 736 states have call predecessors, (765), 765 states have call successors, (765) [2025-02-05 16:10:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 5907 transitions. [2025-02-05 16:10:44,445 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 5907 transitions. Word has length 156 [2025-02-05 16:10:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:44,446 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 5907 transitions. [2025-02-05 16:10:44,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-02-05 16:10:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 5907 transitions. [2025-02-05 16:10:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 16:10:44,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:44,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:44,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:10:44,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:44,656 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1436882158, now seen corresponding path program 1 times [2025-02-05 16:10:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221422490] [2025-02-05 16:10:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:44,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 16:10:44,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 16:10:44,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221422490] [2025-02-05 16:10:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221422490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603727976] [2025-02-05 16:10:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:45,365 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-02-05 16:10:45,407 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-02-05 16:10:45,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 16:10:45,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 16:10:45,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:45,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:45,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 16:10:45,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:46,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603727976] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:46,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2025-02-05 16:10:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43094360] [2025-02-05 16:10:46,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:46,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:10:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:46,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:10:46,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:10:46,818 INFO L87 Difference]: Start difference. First operand 4535 states and 5907 transitions. Second operand has 26 states, 26 states have (on average 9.576923076923077) internal successors, (249), 26 states have internal predecessors, (249), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2025-02-05 16:10:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:49,503 INFO L93 Difference]: Finished difference Result 10420 states and 13569 transitions. [2025-02-05 16:10:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 16:10:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.576923076923077) internal successors, (249), 26 states have internal predecessors, (249), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) Word has length 157 [2025-02-05 16:10:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:49,534 INFO L225 Difference]: With dead ends: 10420 [2025-02-05 16:10:49,534 INFO L226 Difference]: Without dead ends: 6138 [2025-02-05 16:10:49,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=874, Invalid=3158, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 16:10:49,548 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 2688 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:49,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 3348 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:10:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2025-02-05 16:10:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5925. [2025-02-05 16:10:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 4374 states have (on average 1.2974394147233654) internal successors, (5675), 4413 states have internal predecessors, (5675), 999 states have call successors, (999), 551 states have call predecessors, (999), 551 states have return successors, (999), 960 states have call predecessors, (999), 999 states have call successors, (999) [2025-02-05 16:10:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 7673 transitions. [2025-02-05 16:10:50,325 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 7673 transitions. Word has length 157 [2025-02-05 16:10:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:50,326 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 7673 transitions. [2025-02-05 16:10:50,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.576923076923077) internal successors, (249), 26 states have internal predecessors, (249), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2025-02-05 16:10:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 7673 transitions. [2025-02-05 16:10:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:10:50,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:50,337 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:50,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:10:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 16:10:50,542 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2089449779, now seen corresponding path program 1 times [2025-02-05 16:10:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057057676] [2025-02-05 16:10:50,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:50,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:10:50,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:10:50,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:50,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 16:10:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057057676] [2025-02-05 16:10:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057057676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:10:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:10:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:10:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912003635] [2025-02-05 16:10:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:10:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:10:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:50,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:10:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:10:50,749 INFO L87 Difference]: Start difference. First operand 5925 states and 7673 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 16:10:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:52,145 INFO L93 Difference]: Finished difference Result 17361 states and 22545 transitions. [2025-02-05 16:10:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:10:52,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 159 [2025-02-05 16:10:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:52,199 INFO L225 Difference]: With dead ends: 17361 [2025-02-05 16:10:52,199 INFO L226 Difference]: Without dead ends: 11741 [2025-02-05 16:10:52,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:10:52,216 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 225 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:52,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2584 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:10:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11741 states. [2025-02-05 16:10:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11741 to 8409. [2025-02-05 16:10:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 6162 states have (on average 1.2953586497890295) internal successors, (7982), 6219 states have internal predecessors, (7982), 1463 states have call successors, (1463), 783 states have call predecessors, (1463), 783 states have return successors, (1463), 1406 states have call predecessors, (1463), 1463 states have call successors, (1463) [2025-02-05 16:10:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 10908 transitions. [2025-02-05 16:10:53,490 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 10908 transitions. Word has length 159 [2025-02-05 16:10:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:53,490 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 10908 transitions. [2025-02-05 16:10:53,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 16:10:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 10908 transitions. [2025-02-05 16:10:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:10:53,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:53,504 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:53,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:10:53,504 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:53,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -393905533, now seen corresponding path program 1 times [2025-02-05 16:10:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149489309] [2025-02-05 16:10:53,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:53,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:10:53,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:10:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:10:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149489309] [2025-02-05 16:10:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149489309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:10:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365826156] [2025-02-05 16:10:54,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:54,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:54,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:10:54,332 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-02-05 16:10:54,334 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-02-05 16:10:54,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:10:54,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:10:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:10:54,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 16:10:54,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:10:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:10:55,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:10:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:10:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365826156] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:10:56,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:10:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 27 [2025-02-05 16:10:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633631300] [2025-02-05 16:10:56,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:10:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:10:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:10:56,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:10:56,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:10:56,003 INFO L87 Difference]: Start difference. First operand 8409 states and 10908 transitions. Second operand has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-02-05 16:10:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:10:58,248 INFO L93 Difference]: Finished difference Result 17280 states and 22484 transitions. [2025-02-05 16:10:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:10:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 159 [2025-02-05 16:10:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:10:58,290 INFO L225 Difference]: With dead ends: 17280 [2025-02-05 16:10:58,291 INFO L226 Difference]: Without dead ends: 9176 [2025-02-05 16:10:58,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:10:58,308 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 727 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:10:58,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 3920 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:10:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2025-02-05 16:10:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 8812. [2025-02-05 16:10:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8812 states, 6468 states have (on average 1.2942176870748299) internal successors, (8371), 6528 states have internal predecessors, (8371), 1526 states have call successors, (1526), 817 states have call predecessors, (1526), 817 states have return successors, (1526), 1466 states have call predecessors, (1526), 1526 states have call successors, (1526) [2025-02-05 16:10:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8812 states to 8812 states and 11423 transitions. [2025-02-05 16:10:59,552 INFO L78 Accepts]: Start accepts. Automaton has 8812 states and 11423 transitions. Word has length 159 [2025-02-05 16:10:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:10:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 8812 states and 11423 transitions. [2025-02-05 16:10:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-02-05 16:10:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8812 states and 11423 transitions. [2025-02-05 16:10:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 16:10:59,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:10:59,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:10:59,573 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-02-05 16:10:59,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:10:59,765 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:10:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:10:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -158354850, now seen corresponding path program 1 times [2025-02-05 16:10:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:10:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825024870] [2025-02-05 16:10:59,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:10:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:10:59,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 16:10:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 16:10:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:10:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:11:00,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825024870] [2025-02-05 16:11:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825024870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606066862] [2025-02-05 16:11:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:00,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:00,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:00,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:11:00,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 16:11:00,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 16:11:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:00,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:11:00,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:11:00,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:11:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606066862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:01,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 19 [2025-02-05 16:11:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752092183] [2025-02-05 16:11:01,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:01,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:11:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:11:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:11:01,279 INFO L87 Difference]: Start difference. First operand 8812 states and 11423 transitions. Second operand has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-02-05 16:11:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:03,254 INFO L93 Difference]: Finished difference Result 20635 states and 26826 transitions. [2025-02-05 16:11:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:11:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 160 [2025-02-05 16:11:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:03,310 INFO L225 Difference]: With dead ends: 20635 [2025-02-05 16:11:03,310 INFO L226 Difference]: Without dead ends: 12128 [2025-02-05 16:11:03,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 16:11:03,332 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1731 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:03,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2031 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:11:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12128 states. [2025-02-05 16:11:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12128 to 11498. [2025-02-05 16:11:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11498 states, 8427 states have (on average 1.2970214785807523) internal successors, (10930), 8509 states have internal predecessors, (10930), 1998 states have call successors, (1998), 1072 states have call predecessors, (1998), 1072 states have return successors, (1998), 1916 states have call predecessors, (1998), 1998 states have call successors, (1998) [2025-02-05 16:11:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11498 states to 11498 states and 14926 transitions. [2025-02-05 16:11:04,821 INFO L78 Accepts]: Start accepts. Automaton has 11498 states and 14926 transitions. Word has length 160 [2025-02-05 16:11:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:04,821 INFO L471 AbstractCegarLoop]: Abstraction has 11498 states and 14926 transitions. [2025-02-05 16:11:04,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-02-05 16:11:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11498 states and 14926 transitions. [2025-02-05 16:11:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 16:11:04,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:04,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:11:04,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:11:05,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-05 16:11:05,033 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:05,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash -146979562, now seen corresponding path program 1 times [2025-02-05 16:11:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975741467] [2025-02-05 16:11:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:05,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:11:05,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:11:05,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:05,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 16:11:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975741467] [2025-02-05 16:11:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975741467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149067974] [2025-02-05 16:11:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:05,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:05,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:05,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:11:05,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:11:05,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:11:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:05,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 16:11:05,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:11:06,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 16:11:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149067974] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:06,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 24 [2025-02-05 16:11:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21522331] [2025-02-05 16:11:06,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:06,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:11:06,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:06,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:11:06,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:11:06,578 INFO L87 Difference]: Start difference. First operand 11498 states and 14926 transitions. Second operand has 24 states, 23 states have (on average 11.73913043478261) internal successors, (270), 22 states have internal predecessors, (270), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2025-02-05 16:11:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:11,932 INFO L93 Difference]: Finished difference Result 39194 states and 50710 transitions. [2025-02-05 16:11:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-05 16:11:11,932 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 11.73913043478261) internal successors, (270), 22 states have internal predecessors, (270), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) Word has length 161 [2025-02-05 16:11:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:12,058 INFO L225 Difference]: With dead ends: 39194 [2025-02-05 16:11:12,059 INFO L226 Difference]: Without dead ends: 27974 [2025-02-05 16:11:12,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=4222, Unknown=0, NotChecked=0, Total=4970 [2025-02-05 16:11:12,089 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1824 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:12,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 5307 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:11:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27974 states. [2025-02-05 16:11:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27974 to 18482. [2025-02-05 16:11:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18482 states, 13481 states have (on average 1.2974556783621394) internal successors, (17491), 13623 states have internal predecessors, (17491), 3240 states have call successors, (3240), 1760 states have call predecessors, (3240), 1760 states have return successors, (3240), 3098 states have call predecessors, (3240), 3240 states have call successors, (3240) [2025-02-05 16:11:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18482 states to 18482 states and 23971 transitions. [2025-02-05 16:11:14,274 INFO L78 Accepts]: Start accepts. Automaton has 18482 states and 23971 transitions. Word has length 161 [2025-02-05 16:11:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,274 INFO L471 AbstractCegarLoop]: Abstraction has 18482 states and 23971 transitions. [2025-02-05 16:11:14,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 11.73913043478261) internal successors, (270), 22 states have internal predecessors, (270), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2025-02-05 16:11:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18482 states and 23971 transitions. [2025-02-05 16:11:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 16:11:14,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,286 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:11:14,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 16:11:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:14,487 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -546909006, now seen corresponding path program 1 times [2025-02-05 16:11:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778085003] [2025-02-05 16:11:14,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 16:11:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 16:11:14,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 16:11:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778085003] [2025-02-05 16:11:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778085003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:11:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149228650] [2025-02-05 16:11:14,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:11:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:14,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:11:14,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:11:15,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 16:11:15,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 16:11:15,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:15,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:15,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 16:11:15,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:11:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 59 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:11:15,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:11:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 16:11:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149228650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:11:15,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:11:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-02-05 16:11:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134251643] [2025-02-05 16:11:15,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:11:15,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:11:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:15,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:11:15,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:11:15,861 INFO L87 Difference]: Start difference. First operand 18482 states and 23971 transitions. Second operand has 25 states, 25 states have (on average 11.72) internal successors, (293), 24 states have internal predecessors, (293), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (41), 11 states have call predecessors, (41), 10 states have call successors, (41)