./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product11.cil.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/product-lines/email_spec0_product11.cil.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 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:39:33,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:39:33,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:39:33,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:39:33,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:39:33,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:39:33,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:39:33,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:39:33,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:39:33,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:39:33,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:39:33,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:39:33,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:39:33,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:39:33,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:39:33,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:33,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:39:33,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:39:33,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:39:33,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:39:33,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:39:33,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:39:33,777 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 -> 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 [2025-02-05 15:39:34,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:39:34,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:39:34,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:39:34,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:39:34,024 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:39:34,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-02-05 15:39:35,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2afe9078b/063d203bff9d411d9218cc70beb0e81c/FLAG5faaeba7d [2025-02-05 15:39:35,483 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:39:35,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-02-05 15:39:35,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2afe9078b/063d203bff9d411d9218cc70beb0e81c/FLAG5faaeba7d [2025-02-05 15:39:35,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2afe9078b/063d203bff9d411d9218cc70beb0e81c [2025-02-05 15:39:35,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:39:35,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:39:35,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:35,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:39:35,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:39:35,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:35" (1/1) ... [2025-02-05 15:39:35,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ca4528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:35, skipping insertion in model container [2025-02-05 15:39:35,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:35" (1/1) ... [2025-02-05 15:39:35,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:39:36,211 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/product-lines/email_spec0_product11.cil.c[59717,59730] [2025-02-05 15:39:36,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:36,228 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:39:36,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:39:36,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-02-05 15:39:36,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-02-05 15:39:36,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [576] [2025-02-05 15:39:36,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [876] [2025-02-05 15:39:36,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [896] [2025-02-05 15:39:36,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1262] [2025-02-05 15:39:36,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1478] [2025-02-05 15:39:36,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1671] [2025-02-05 15:39:36,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2740] [2025-02-05 15:39:36,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2749] [2025-02-05 15:39:36,308 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/product-lines/email_spec0_product11.cil.c[59717,59730] [2025-02-05 15:39:36,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:36,341 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:39:36,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36 WrapperNode [2025-02-05 15:39:36,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:36,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:36,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:39:36,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:39:36,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,409 INFO L138 Inliner]: procedures = 121, calls = 162, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 796 [2025-02-05 15:39:36,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:36,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:39:36,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:39:36,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:39:36,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,456 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:39:36,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:39:36,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:39:36,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:39:36,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:39:36,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (1/1) ... [2025-02-05 15:39:36,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:36,611 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 15:39:36,615 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 15:39:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:39:36,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:39:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:39:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:39:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:39:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:39:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:39:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:39:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:39:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:39:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:39:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:39:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:39:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:39:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:39:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:39:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:39:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:39:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:39:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:39:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:39:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:39:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:39:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:39:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:39:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:39:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:39:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:39:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:39:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:39:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:39:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:39:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:39:36,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:39:36,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:39:37,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2670-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~40#1; [2025-02-05 15:39:37,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717-1: getClientId_#res#1 := getClientId_~retValue_acc~41#1; [2025-02-05 15:39:37,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~2#1; [2025-02-05 15:39:37,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-02-05 15:39:37,046 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:39:37,088 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2329-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~35#1; [2025-02-05 15:39:37,088 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: #res#1 := ~retValue_acc~36#1; [2025-02-05 15:39:37,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L573-1: createEmail_#res#1 := createEmail_~retValue_acc~15#1; [2025-02-05 15:39:37,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-02-05 15:39:37,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-02-05 15:39:37,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1610-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-02-05 15:39:37,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-02-05 15:39:37,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~38#1; [2025-02-05 15:39:37,441 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~37#1; [2025-02-05 15:39:37,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L549: #res := ~retValue_acc~13; [2025-02-05 15:39:37,560 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-02-05 15:39:37,561 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:39:37,575 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:39:37,575 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:39:37,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:37 BoogieIcfgContainer [2025-02-05 15:39:37,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:39:37,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:39:37,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:39:37,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:39:37,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:39:35" (1/3) ... [2025-02-05 15:39:37,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6410d387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:37, skipping insertion in model container [2025-02-05 15:39:37,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:36" (2/3) ... [2025-02-05 15:39:37,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6410d387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:37, skipping insertion in model container [2025-02-05 15:39:37,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:37" (3/3) ... [2025-02-05 15:39:37,585 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product11.cil.c [2025-02-05 15:39:37,595 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:39:37,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product11.cil.c that has 14 procedures, 234 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:39:37,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:39:37,655 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;@28b855ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:39:37,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:39:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 15:39:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:39:37,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:37,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 15:39:37,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:37,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -556985858, now seen corresponding path program 1 times [2025-02-05 15:39:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158705295] [2025-02-05 15:39:37,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:37,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:39:37,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:39:37,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:37,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:39:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158705295] [2025-02-05 15:39:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158705295] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575094545] [2025-02-05 15:39:38,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:38,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:38,226 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 15:39:38,228 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 15:39:38,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:39:38,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:39:38,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:38,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:39:38,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:39:38,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575094545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:38,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:38,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:39:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805591800] [2025-02-05 15:39:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:39:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:38,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:39:38,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:38,581 INFO L87 Difference]: Start difference. First operand has 234 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:38,614 INFO L93 Difference]: Finished difference Result 315 states and 458 transitions. [2025-02-05 15:39:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:39:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2025-02-05 15:39:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:38,624 INFO L225 Difference]: With dead ends: 315 [2025-02-05 15:39:38,625 INFO L226 Difference]: Without dead ends: 227 [2025-02-05 15:39:38,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:38,628 INFO L435 NwaCegarLoop]: 348 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, 348 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 15:39:38,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-05 15:39:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-02-05 15:39:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 178 states have (on average 1.5224719101123596) internal successors, (271), 179 states have internal predecessors, (271), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:39:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 340 transitions. [2025-02-05 15:39:38,670 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 340 transitions. Word has length 93 [2025-02-05 15:39:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:38,671 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 340 transitions. [2025-02-05 15:39:38,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 340 transitions. [2025-02-05 15:39:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:39:38,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:38,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 15:39:38,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:39:38,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:39:38,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:38,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1280477104, now seen corresponding path program 1 times [2025-02-05 15:39:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-02-05 15:39:38,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:38,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:39:38,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:39:38,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:39:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-02-05 15:39:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121203527] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536936762] [2025-02-05 15:39:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:39,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:39,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:39,053 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 15:39:39,055 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 15:39:39,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:39:39,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:39:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:39,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:39:39,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:39:39,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536936762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:39:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192639971] [2025-02-05 15:39:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:39,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:39,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:39,295 INFO L87 Difference]: Start difference. First operand 227 states and 340 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:39,329 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2025-02-05 15:39:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2025-02-05 15:39:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:39,333 INFO L225 Difference]: With dead ends: 304 [2025-02-05 15:39:39,334 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 15:39:39,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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 15:39:39,335 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:39,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 676 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 15:39:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-05 15:39:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 180 states have (on average 1.5166666666666666) internal successors, (273), 181 states have internal predecessors, (273), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:39:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 342 transitions. [2025-02-05 15:39:39,347 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 342 transitions. Word has length 94 [2025-02-05 15:39:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:39,347 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 342 transitions. [2025-02-05 15:39:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 342 transitions. [2025-02-05 15:39:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:39:39,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:39,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 15:39:39,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:39,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1947403191, now seen corresponding path program 1 times [2025-02-05 15:39:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248628607] [2025-02-05 15:39:39,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:39,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:39:39,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:39:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:39,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:39:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248628607] [2025-02-05 15:39:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248628607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772828532] [2025-02-05 15:39:39,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:39,743 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 15:39:39,744 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 15:39:39,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:39:39,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:39:39,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:39,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:39,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:39,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:39:39,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772828532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:39:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365872511] [2025-02-05 15:39:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:39,982 INFO L87 Difference]: Start difference. First operand 229 states and 342 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:40,005 INFO L93 Difference]: Finished difference Result 487 states and 742 transitions. [2025-02-05 15:39:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:40,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:39:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:40,008 INFO L225 Difference]: With dead ends: 487 [2025-02-05 15:39:40,008 INFO L226 Difference]: Without dead ends: 285 [2025-02-05 15:39:40,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:40,013 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 107 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:40,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 642 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-05 15:39:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2025-02-05 15:39:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 217 states have (on average 1.5391705069124424) internal successors, (334), 218 states have internal predecessors, (334), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-05 15:39:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 425 transitions. [2025-02-05 15:39:40,036 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 425 transitions. Word has length 99 [2025-02-05 15:39:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 425 transitions. [2025-02-05 15:39:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 425 transitions. [2025-02-05 15:39:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:39:40,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:40,039 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 15:39:40,047 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 15:39:40,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:40,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 349329621, now seen corresponding path program 1 times [2025-02-05 15:39:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291339168] [2025-02-05 15:39:40,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:40,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:39:40,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:39:40,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:40,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:39:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291339168] [2025-02-05 15:39:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291339168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70134681] [2025-02-05 15:39:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:40,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:40,386 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 15:39:40,388 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 15:39:40,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:39:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:39:40,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:40,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:39:40,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:39:40,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:40,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70134681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:40,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:39:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787246129] [2025-02-05 15:39:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:40,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:40,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:40,644 INFO L87 Difference]: Start difference. First operand 277 states and 425 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:40,687 INFO L93 Difference]: Finished difference Result 545 states and 840 transitions. [2025-02-05 15:39:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-02-05 15:39:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:40,690 INFO L225 Difference]: With dead ends: 545 [2025-02-05 15:39:40,690 INFO L226 Difference]: Without dead ends: 279 [2025-02-05 15:39:40,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:40,693 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 2 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:40,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1317 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-05 15:39:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-02-05 15:39:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 218 states have (on average 1.536697247706422) internal successors, (335), 220 states have internal predecessors, (335), 46 states have call successors, (46), 13 states have call predecessors, (46), 14 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2025-02-05 15:39:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 428 transitions. [2025-02-05 15:39:40,712 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 428 transitions. Word has length 100 [2025-02-05 15:39:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:40,712 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 428 transitions. [2025-02-05 15:39:40,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 428 transitions. [2025-02-05 15:39:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:39:40,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:40,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:39:40,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:40,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:40,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash 102034716, now seen corresponding path program 1 times [2025-02-05 15:39:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622587563] [2025-02-05 15:39:40,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:39:40,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:39:40,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:40,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:39:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622587563] [2025-02-05 15:39:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622587563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187034625] [2025-02-05 15:39:41,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:41,073 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 15:39:41,074 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 15:39:41,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:39:41,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:39:41,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:41,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:41,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:39:41,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:39:41,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187034625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:41,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:41,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:39:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101620596] [2025-02-05 15:39:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:41,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:41,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:41,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:39:41,317 INFO L87 Difference]: Start difference. First operand 279 states and 428 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:41,363 INFO L93 Difference]: Finished difference Result 547 states and 845 transitions. [2025-02-05 15:39:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-02-05 15:39:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:41,365 INFO L225 Difference]: With dead ends: 547 [2025-02-05 15:39:41,365 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 15:39:41,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:39:41,367 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:41,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1303 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 15:39:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-05 15:39:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 219 states have (on average 1.5342465753424657) internal successors, (336), 222 states have internal predecessors, (336), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2025-02-05 15:39:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 434 transitions. [2025-02-05 15:39:41,378 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 434 transitions. Word has length 101 [2025-02-05 15:39:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:41,378 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 434 transitions. [2025-02-05 15:39:41,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 434 transitions. [2025-02-05 15:39:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:39:41,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:41,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 15:39:41,387 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 15:39:41,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:41,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:41,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1720548826, now seen corresponding path program 1 times [2025-02-05 15:39:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891408863] [2025-02-05 15:39:41,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:41,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:39:41,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:39:41,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:41,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:39:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891408863] [2025-02-05 15:39:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891408863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:41,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:39:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938934974] [2025-02-05 15:39:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:41,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:41,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:41,697 INFO L87 Difference]: Start difference. First operand 281 states and 434 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:41,730 INFO L93 Difference]: Finished difference Result 539 states and 836 transitions. [2025-02-05 15:39:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:41,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-02-05 15:39:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:41,737 INFO L225 Difference]: With dead ends: 539 [2025-02-05 15:39:41,737 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 15:39:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:41,738 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:41,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1321 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 15:39:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-05 15:39:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 219 states have (on average 1.5342465753424657) internal successors, (336), 222 states have internal predecessors, (336), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2025-02-05 15:39:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 433 transitions. [2025-02-05 15:39:41,756 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 433 transitions. Word has length 102 [2025-02-05 15:39:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 433 transitions. [2025-02-05 15:39:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 433 transitions. [2025-02-05 15:39:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:39:41,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:41,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 15:39:41,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:39:41,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1449434613, now seen corresponding path program 2 times [2025-02-05 15:39:41,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598614794] [2025-02-05 15:39:41,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:39:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:41,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-02-05 15:39:41,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 103 statements. [2025-02-05 15:39:41,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:39:41,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:39:41,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:41,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598614794] [2025-02-05 15:39:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598614794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:41,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:41,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:39:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133679628] [2025-02-05 15:39:41,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:41,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:41,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:41,837 INFO L87 Difference]: Start difference. First operand 281 states and 433 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:41,881 INFO L93 Difference]: Finished difference Result 604 states and 921 transitions. [2025-02-05 15:39:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:39:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-05 15:39:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:41,885 INFO L225 Difference]: With dead ends: 604 [2025-02-05 15:39:41,885 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:39:41,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:41,886 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 298 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:41,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1321 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:39:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2025-02-05 15:39:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 419 states have (on average 1.5513126491646778) internal successors, (650), 423 states have internal predecessors, (650), 86 states have call successors, (86), 25 states have call predecessors, (86), 27 states have return successors, (90), 84 states have call predecessors, (90), 84 states have call successors, (90) [2025-02-05 15:39:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 826 transitions. [2025-02-05 15:39:41,909 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 826 transitions. Word has length 103 [2025-02-05 15:39:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:41,909 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 826 transitions. [2025-02-05 15:39:41,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 826 transitions. [2025-02-05 15:39:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:39:41,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:41,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:39:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:39:41,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1082156391, now seen corresponding path program 1 times [2025-02-05 15:39:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201880775] [2025-02-05 15:39:41,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:41,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:39:41,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:39:41,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:39:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201880775] [2025-02-05 15:39:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201880775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:39:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251347445] [2025-02-05 15:39:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:42,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:42,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:42,011 INFO L87 Difference]: Start difference. First operand 533 states and 826 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:42,047 INFO L93 Difference]: Finished difference Result 1045 states and 1625 transitions. [2025-02-05 15:39:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-02-05 15:39:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:42,050 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 15:39:42,050 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:39:42,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:42,052 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:42,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1324 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:39:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:39:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 420 states have (on average 1.55) internal successors, (651), 425 states have internal predecessors, (651), 86 states have call successors, (86), 25 states have call predecessors, (86), 28 states have return successors, (92), 84 states have call predecessors, (92), 84 states have call successors, (92) [2025-02-05 15:39:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 829 transitions. [2025-02-05 15:39:42,071 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 829 transitions. Word has length 104 [2025-02-05 15:39:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:42,072 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 829 transitions. [2025-02-05 15:39:42,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:39:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 829 transitions. [2025-02-05 15:39:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:39:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:42,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 15:39:42,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:39:42,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1770106447, now seen corresponding path program 1 times [2025-02-05 15:39:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043598195] [2025-02-05 15:39:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:39:42,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:39:42,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:39:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043598195] [2025-02-05 15:39:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043598195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:42,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:39:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706635621] [2025-02-05 15:39:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:42,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:39:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:42,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:39:42,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:42,194 INFO L87 Difference]: Start difference. First operand 535 states and 829 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:39:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:42,310 INFO L93 Difference]: Finished difference Result 1049 states and 1628 transitions. [2025-02-05 15:39:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:39:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-02-05 15:39:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:42,313 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 15:39:42,313 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 15:39:42,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:42,315 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 7 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:42,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2239 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 15:39:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2025-02-05 15:39:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 422 states have (on average 1.54739336492891) internal successors, (653), 426 states have internal predecessors, (653), 86 states have call successors, (86), 26 states have call predecessors, (86), 28 states have return successors, (91), 84 states have call predecessors, (91), 84 states have call successors, (91) [2025-02-05 15:39:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 830 transitions. [2025-02-05 15:39:42,337 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 830 transitions. Word has length 105 [2025-02-05 15:39:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 830 transitions. [2025-02-05 15:39:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:39:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 830 transitions. [2025-02-05 15:39:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:39:42,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:42,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:39:42,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:39:42,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 470611863, now seen corresponding path program 2 times [2025-02-05 15:39:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916965828] [2025-02-05 15:39:42,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:39:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-02-05 15:39:42,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 106 statements. [2025-02-05 15:39:42,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:39:42,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:39:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916965828] [2025-02-05 15:39:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916965828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:39:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848277985] [2025-02-05 15:39:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:42,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:39:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:42,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:39:42,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:42,414 INFO L87 Difference]: Start difference. First operand 537 states and 830 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:42,467 INFO L93 Difference]: Finished difference Result 1185 states and 1802 transitions. [2025-02-05 15:39:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:39:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-05 15:39:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:42,472 INFO L225 Difference]: With dead ends: 1185 [2025-02-05 15:39:42,473 INFO L226 Difference]: Without dead ends: 1049 [2025-02-05 15:39:42,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:42,474 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 295 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:42,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1312 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-05 15:39:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1037. [2025-02-05 15:39:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 824 states have internal predecessors, (1277), 166 states have call successors, (166), 50 states have call predecessors, (166), 52 states have return successors, (169), 162 states have call predecessors, (169), 162 states have call successors, (169) [2025-02-05 15:39:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1612 transitions. [2025-02-05 15:39:42,517 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1612 transitions. Word has length 106 [2025-02-05 15:39:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:42,517 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1612 transitions. [2025-02-05 15:39:42,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1612 transitions. [2025-02-05 15:39:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:39:42,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:42,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 15:39:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:39:42,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -311975146, now seen corresponding path program 1 times [2025-02-05 15:39:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106681889] [2025-02-05 15:39:42,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:39:42,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:39:42,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:39:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106681889] [2025-02-05 15:39:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106681889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:42,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:39:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319470680] [2025-02-05 15:39:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:42,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:39:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:42,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:39:42,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:42,649 INFO L87 Difference]: Start difference. First operand 1037 states and 1612 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:39:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:42,861 INFO L93 Difference]: Finished difference Result 2056 states and 3207 transitions. [2025-02-05 15:39:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:39:42,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-02-05 15:39:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:42,867 INFO L225 Difference]: With dead ends: 2056 [2025-02-05 15:39:42,867 INFO L226 Difference]: Without dead ends: 1046 [2025-02-05 15:39:42,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:42,870 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 5 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:42,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2253 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:39:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-05 15:39:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1040. [2025-02-05 15:39:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 820 states have (on average 1.5597560975609757) internal successors, (1279), 827 states have internal predecessors, (1279), 166 states have call successors, (166), 50 states have call predecessors, (166), 53 states have return successors, (174), 162 states have call predecessors, (174), 162 states have call successors, (174) [2025-02-05 15:39:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1619 transitions. [2025-02-05 15:39:42,913 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1619 transitions. Word has length 107 [2025-02-05 15:39:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:42,913 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1619 transitions. [2025-02-05 15:39:42,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:39:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1619 transitions. [2025-02-05 15:39:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:39:42,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:42,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1] [2025-02-05 15:39:42,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:39:42,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 220712507, now seen corresponding path program 1 times [2025-02-05 15:39:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661971288] [2025-02-05 15:39:42,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:39:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:39:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661971288] [2025-02-05 15:39:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661971288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338678950] [2025-02-05 15:39:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:43,025 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 15:39:43,025 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 15:39:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:39:43,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:39:43,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:43,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:43,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:43,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:43,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:39:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338678950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:39:43,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:39:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:39:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543636928] [2025-02-05 15:39:43,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:39:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:39:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:43,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:39:43,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:43,351 INFO L87 Difference]: Start difference. First operand 1040 states and 1619 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:39:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:43,488 INFO L93 Difference]: Finished difference Result 2224 states and 3515 transitions. [2025-02-05 15:39:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 108 [2025-02-05 15:39:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:43,498 INFO L225 Difference]: With dead ends: 2224 [2025-02-05 15:39:43,499 INFO L226 Difference]: Without dead ends: 1922 [2025-02-05 15:39:43,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:43,501 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 414 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:43,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1266 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-02-05 15:39:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1858. [2025-02-05 15:39:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1482 states have (on average 1.6012145748987854) internal successors, (2373), 1489 states have internal predecessors, (2373), 322 states have call successors, (322), 50 states have call predecessors, (322), 53 states have return successors, (340), 318 states have call predecessors, (340), 318 states have call successors, (340) [2025-02-05 15:39:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3035 transitions. [2025-02-05 15:39:43,581 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3035 transitions. Word has length 108 [2025-02-05 15:39:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:43,581 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 3035 transitions. [2025-02-05 15:39:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:39:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3035 transitions. [2025-02-05 15:39:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:39:43,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:43,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:43,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:43,789 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,SelfDestructingSolverStorable11 [2025-02-05 15:39:43,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -57997093, now seen corresponding path program 1 times [2025-02-05 15:39:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944428751] [2025-02-05 15:39:43,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:43,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:39:43,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:39:43,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:43,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:43,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:43,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944428751] [2025-02-05 15:39:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944428751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:43,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:43,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609341132] [2025-02-05 15:39:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:43,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:43,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:43,848 INFO L87 Difference]: Start difference. First operand 1858 states and 3035 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:43,911 INFO L93 Difference]: Finished difference Result 4530 states and 7477 transitions. [2025-02-05 15:39:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-02-05 15:39:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:43,923 INFO L225 Difference]: With dead ends: 4530 [2025-02-05 15:39:43,924 INFO L226 Difference]: Without dead ends: 2741 [2025-02-05 15:39:43,929 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 15:39:43,929 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 105 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:43,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2025-02-05 15:39:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2709. [2025-02-05 15:39:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2166 states have (on average 1.6103416435826408) internal successors, (3488), 2173 states have internal predecessors, (3488), 489 states have call successors, (489), 50 states have call predecessors, (489), 53 states have return successors, (517), 485 states have call predecessors, (517), 485 states have call successors, (517) [2025-02-05 15:39:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4494 transitions. [2025-02-05 15:39:44,035 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4494 transitions. Word has length 114 [2025-02-05 15:39:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 4494 transitions. [2025-02-05 15:39:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4494 transitions. [2025-02-05 15:39:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:39:44,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:44,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:44,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:39:44,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:44,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1424482488, now seen corresponding path program 1 times [2025-02-05 15:39:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404228956] [2025-02-05 15:39:44,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:44,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:39:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:39:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404228956] [2025-02-05 15:39:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404228956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:44,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:44,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45339826] [2025-02-05 15:39:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:44,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:44,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:44,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:44,113 INFO L87 Difference]: Start difference. First operand 2709 states and 4494 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:44,232 INFO L93 Difference]: Finished difference Result 6698 states and 11183 transitions. [2025-02-05 15:39:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-05 15:39:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:44,251 INFO L225 Difference]: With dead ends: 6698 [2025-02-05 15:39:44,252 INFO L226 Difference]: Without dead ends: 4109 [2025-02-05 15:39:44,260 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 15:39:44,261 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 103 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-02-05 15:39:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4077. [2025-02-05 15:39:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4077 states, 3275 states have (on average 1.6177099236641221) internal successors, (5298), 3282 states have internal predecessors, (5298), 748 states have call successors, (748), 50 states have call predecessors, (748), 53 states have return successors, (776), 744 states have call predecessors, (776), 744 states have call successors, (776) [2025-02-05 15:39:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4077 states to 4077 states and 6822 transitions. [2025-02-05 15:39:44,440 INFO L78 Accepts]: Start accepts. Automaton has 4077 states and 6822 transitions. Word has length 115 [2025-02-05 15:39:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:44,441 INFO L471 AbstractCegarLoop]: Abstraction has 4077 states and 6822 transitions. [2025-02-05 15:39:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4077 states and 6822 transitions. [2025-02-05 15:39:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:39:44,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:44,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:44,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:39:44,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1799998308, now seen corresponding path program 1 times [2025-02-05 15:39:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808860025] [2025-02-05 15:39:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:44,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:39:44,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:39:44,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808860025] [2025-02-05 15:39:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808860025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:44,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491251988] [2025-02-05 15:39:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:44,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:44,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:44,505 INFO L87 Difference]: Start difference. First operand 4077 states and 6822 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:44,649 INFO L93 Difference]: Finished difference Result 10158 states and 17112 transitions. [2025-02-05 15:39:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-02-05 15:39:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:44,677 INFO L225 Difference]: With dead ends: 10158 [2025-02-05 15:39:44,677 INFO L226 Difference]: Without dead ends: 6323 [2025-02-05 15:39:44,687 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 15:39:44,687 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 101 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2025-02-05 15:39:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 6291. [2025-02-05 15:39:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6291 states, 5128 states have (on average 1.62695007800312) internal successors, (8343), 5135 states have internal predecessors, (8343), 1109 states have call successors, (1109), 50 states have call predecessors, (1109), 53 states have return successors, (1153), 1105 states have call predecessors, (1153), 1105 states have call successors, (1153) [2025-02-05 15:39:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6291 states to 6291 states and 10605 transitions. [2025-02-05 15:39:44,937 INFO L78 Accepts]: Start accepts. Automaton has 6291 states and 10605 transitions. Word has length 116 [2025-02-05 15:39:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:44,937 INFO L471 AbstractCegarLoop]: Abstraction has 6291 states and 10605 transitions. [2025-02-05 15:39:44,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6291 states and 10605 transitions. [2025-02-05 15:39:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:39:44,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:44,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:39:44,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1231638359, now seen corresponding path program 1 times [2025-02-05 15:39:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848909010] [2025-02-05 15:39:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:44,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:39:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:39:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848909010] [2025-02-05 15:39:45,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848909010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:45,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:45,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107128509] [2025-02-05 15:39:45,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:45,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:45,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:45,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:45,006 INFO L87 Difference]: Start difference. First operand 6291 states and 10605 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:45,287 INFO L93 Difference]: Finished difference Result 15985 states and 27110 transitions. [2025-02-05 15:39:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:39:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:45,330 INFO L225 Difference]: With dead ends: 15985 [2025-02-05 15:39:45,330 INFO L226 Difference]: Without dead ends: 10136 [2025-02-05 15:39:45,350 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 15:39:45,351 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 99 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:45,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10136 states. [2025-02-05 15:39:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10136 to 10104. [2025-02-05 15:39:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10104 states, 8380 states have (on average 1.6356801909307876) internal successors, (13707), 8387 states have internal predecessors, (13707), 1670 states have call successors, (1670), 50 states have call predecessors, (1670), 53 states have return successors, (1740), 1666 states have call predecessors, (1740), 1666 states have call successors, (1740) [2025-02-05 15:39:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10104 states to 10104 states and 17117 transitions. [2025-02-05 15:39:45,785 INFO L78 Accepts]: Start accepts. Automaton has 10104 states and 17117 transitions. Word has length 117 [2025-02-05 15:39:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 10104 states and 17117 transitions. [2025-02-05 15:39:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10104 states and 17117 transitions. [2025-02-05 15:39:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:39:45,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:45,804 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:39:45,804 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash 818060093, now seen corresponding path program 1 times [2025-02-05 15:39:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483364882] [2025-02-05 15:39:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:45,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:39:45,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:39:45,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:45,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483364882] [2025-02-05 15:39:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483364882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:45,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398202015] [2025-02-05 15:39:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:45,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:45,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:45,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:45,849 INFO L87 Difference]: Start difference. First operand 10104 states and 17117 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:46,196 INFO L93 Difference]: Finished difference Result 25452 states and 43470 transitions. [2025-02-05 15:39:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:46,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:39:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:46,299 INFO L225 Difference]: With dead ends: 25452 [2025-02-05 15:39:46,299 INFO L226 Difference]: Without dead ends: 17086 [2025-02-05 15:39:46,331 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 15:39:46,331 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 97 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 686 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17086 states. [2025-02-05 15:39:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17086 to 17054. [2025-02-05 15:39:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17054 states, 14010 states have (on average 1.636688079942898) internal successors, (22930), 14017 states have internal predecessors, (22930), 2990 states have call successors, (2990), 50 states have call predecessors, (2990), 53 states have return successors, (3104), 2986 states have call predecessors, (3104), 2986 states have call successors, (3104) [2025-02-05 15:39:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17054 states to 17054 states and 29024 transitions. [2025-02-05 15:39:47,053 INFO L78 Accepts]: Start accepts. Automaton has 17054 states and 29024 transitions. Word has length 118 [2025-02-05 15:39:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:47,053 INFO L471 AbstractCegarLoop]: Abstraction has 17054 states and 29024 transitions. [2025-02-05 15:39:47,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 17054 states and 29024 transitions. [2025-02-05 15:39:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:39:47,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:47,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:47,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:39:47,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1198221302, now seen corresponding path program 1 times [2025-02-05 15:39:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:47,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761501669] [2025-02-05 15:39:47,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:47,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:39:47,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:39:47,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:47,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761501669] [2025-02-05 15:39:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761501669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:47,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029365077] [2025-02-05 15:39:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:47,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:47,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:47,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:47,145 INFO L87 Difference]: Start difference. First operand 17054 states and 29024 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:47,974 INFO L93 Difference]: Finished difference Result 45246 states and 77397 transitions. [2025-02-05 15:39:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:39:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:48,079 INFO L225 Difference]: With dead ends: 45246 [2025-02-05 15:39:48,079 INFO L226 Difference]: Without dead ends: 30171 [2025-02-05 15:39:48,115 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 15:39:48,116 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 95 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30171 states. [2025-02-05 15:39:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30171 to 30139. [2025-02-05 15:39:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30139 states, 24901 states have (on average 1.6342315569655836) internal successors, (40694), 24908 states have internal predecessors, (40694), 5184 states have call successors, (5184), 50 states have call predecessors, (5184), 53 states have return successors, (5376), 5180 states have call predecessors, (5376), 5180 states have call successors, (5376) [2025-02-05 15:39:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30139 states to 30139 states and 51254 transitions. [2025-02-05 15:39:49,021 INFO L78 Accepts]: Start accepts. Automaton has 30139 states and 51254 transitions. Word has length 119 [2025-02-05 15:39:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:49,021 INFO L471 AbstractCegarLoop]: Abstraction has 30139 states and 51254 transitions. [2025-02-05 15:39:49,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30139 states and 51254 transitions. [2025-02-05 15:39:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:39:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:49,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:49,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:39:49,049 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:49,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1818434494, now seen corresponding path program 1 times [2025-02-05 15:39:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707624266] [2025-02-05 15:39:49,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:49,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:39:49,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:39:49,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:49,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707624266] [2025-02-05 15:39:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707624266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404255199] [2025-02-05 15:39:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:49,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:49,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:49,099 INFO L87 Difference]: Start difference. First operand 30139 states and 51254 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:50,260 INFO L93 Difference]: Finished difference Result 83162 states and 141830 transitions. [2025-02-05 15:39:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:50,260 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:39:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:50,492 INFO L225 Difference]: With dead ends: 83162 [2025-02-05 15:39:50,492 INFO L226 Difference]: Without dead ends: 55793 [2025-02-05 15:39:50,565 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 15:39:50,566 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:50,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 694 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55793 states. [2025-02-05 15:39:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55793 to 55761. [2025-02-05 15:39:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55761 states, 46000 states have (on average 1.6237608695652175) internal successors, (74693), 46007 states have internal predecessors, (74693), 9707 states have call successors, (9707), 50 states have call predecessors, (9707), 53 states have return successors, (10043), 9703 states have call predecessors, (10043), 9703 states have call successors, (10043) [2025-02-05 15:39:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55761 states to 55761 states and 94443 transitions. [2025-02-05 15:39:52,551 INFO L78 Accepts]: Start accepts. Automaton has 55761 states and 94443 transitions. Word has length 120 [2025-02-05 15:39:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:52,552 INFO L471 AbstractCegarLoop]: Abstraction has 55761 states and 94443 transitions. [2025-02-05 15:39:52,552 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 55761 states and 94443 transitions. [2025-02-05 15:39:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:39:52,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:52,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:39:52,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash 620376341, now seen corresponding path program 1 times [2025-02-05 15:39:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771554506] [2025-02-05 15:39:52,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:52,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:39:52,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:39:52,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:52,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771554506] [2025-02-05 15:39:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771554506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:52,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:52,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837208461] [2025-02-05 15:39:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:52,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:52,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:52,641 INFO L87 Difference]: Start difference. First operand 55761 states and 94443 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:54,749 INFO L93 Difference]: Finished difference Result 155411 states and 264114 transitions. [2025-02-05 15:39:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:39:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:55,241 INFO L225 Difference]: With dead ends: 155411 [2025-02-05 15:39:55,241 INFO L226 Difference]: Without dead ends: 103504 [2025-02-05 15:39:55,419 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 15:39:55,422 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103504 states. [2025-02-05 15:39:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103504 to 103472. [2025-02-05 15:39:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103472 states, 85860 states have (on average 1.6186932215234102) internal successors, (138981), 85867 states have internal predecessors, (138981), 17558 states have call successors, (17558), 50 states have call predecessors, (17558), 53 states have return successors, (18168), 17554 states have call predecessors, (18168), 17554 states have call successors, (18168) [2025-02-05 15:39:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103472 states to 103472 states and 174707 transitions. [2025-02-05 15:39:58,603 INFO L78 Accepts]: Start accepts. Automaton has 103472 states and 174707 transitions. Word has length 121 [2025-02-05 15:39:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:58,603 INFO L471 AbstractCegarLoop]: Abstraction has 103472 states and 174707 transitions. [2025-02-05 15:39:58,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 103472 states and 174707 transitions. [2025-02-05 15:39:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:39:58,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:58,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:58,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:39:58,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -407045857, now seen corresponding path program 1 times [2025-02-05 15:39:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158836705] [2025-02-05 15:39:58,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:58,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:39:58,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:39:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:58,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:39:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158836705] [2025-02-05 15:39:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158836705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:39:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822580765] [2025-02-05 15:39:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:58,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:58,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:39:58,689 INFO L87 Difference]: Start difference. First operand 103472 states and 174707 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:03,109 INFO L93 Difference]: Finished difference Result 293203 states and 496305 transitions. [2025-02-05 15:40:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:40:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:03,854 INFO L225 Difference]: With dead ends: 293203 [2025-02-05 15:40:03,854 INFO L226 Difference]: Without dead ends: 194834 [2025-02-05 15:40:04,074 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 15:40:04,076 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 89 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:04,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 675 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:40:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194834 states. [2025-02-05 15:40:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194834 to 194802. [2025-02-05 15:40:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194802 states, 162671 states have (on average 1.6120943499455958) internal successors, (262241), 162678 states have internal predecessors, (262241), 32077 states have call successors, (32077), 50 states have call predecessors, (32077), 53 states have return successors, (33219), 32073 states have call predecessors, (33219), 32073 states have call successors, (33219) [2025-02-05 15:40:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194802 states to 194802 states and 327537 transitions. [2025-02-05 15:40:11,254 INFO L78 Accepts]: Start accepts. Automaton has 194802 states and 327537 transitions. Word has length 122 [2025-02-05 15:40:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:11,255 INFO L471 AbstractCegarLoop]: Abstraction has 194802 states and 327537 transitions. [2025-02-05 15:40:11,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 194802 states and 327537 transitions. [2025-02-05 15:40:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:40:11,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:11,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:40:11,307 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2005016172, now seen corresponding path program 1 times [2025-02-05 15:40:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884094024] [2025-02-05 15:40:11,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:40:11,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:40:11,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:11,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:40:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884094024] [2025-02-05 15:40:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884094024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:11,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633304828] [2025-02-05 15:40:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:11,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:11,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:11,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:11,394 INFO L87 Difference]: Start difference. First operand 194802 states and 327537 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)