./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cd09b7e02dd7459ada96201e9b5a915c0f0209c05135bf5a5174f874492a34ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:13,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:13,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:13,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:13,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:13,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:13,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:13,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:13,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:13,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:13,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:13,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:13,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:13,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:13,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:13,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:13,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:13,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:13,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:13,743 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/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 -> cd09b7e02dd7459ada96201e9b5a915c0f0209c05135bf5a5174f874492a34ab [2025-03-03 14:26:13,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:13,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:13,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:13,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:13,979 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:13,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2025-03-03 14:26:15,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1638aad55/9c022cdabf7648b4a0114ead9dac9637/FLAG776483b2f [2025-03-03 14:26:15,494 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:15,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2025-03-03 14:26:15,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1638aad55/9c022cdabf7648b4a0114ead9dac9637/FLAG776483b2f [2025-03-03 14:26:15,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1638aad55/9c022cdabf7648b4a0114ead9dac9637 [2025-03-03 14:26:15,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:15,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:15,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:15,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:15,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:15,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:15" (1/1) ... [2025-03-03 14:26:15,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fe8ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:15, skipping insertion in model container [2025-03-03 14:26:15,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:15" (1/1) ... [2025-03-03 14:26:15,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:15,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product12.cil.c[16969,16982] [2025-03-03 14:26:15,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:15,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:15,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [414] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [717] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [752] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [761] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [974] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1386] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1428] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1533] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1765] [2025-03-03 14:26:15,941 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2834] [2025-03-03 14:26:15,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product12.cil.c[16969,16982] [2025-03-03 14:26:16,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:16,034 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16 WrapperNode [2025-03-03 14:26:16,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:16,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:16,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:16,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:16,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,089 INFO L138 Inliner]: procedures = 123, calls = 177, calls flagged for inlining = 51, calls inlined = 41, statements flattened = 837 [2025-03-03 14:26:16,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:16,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:16,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:16,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:16,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,125 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-03-03 14:26:16,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:16,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:16,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:16,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:16,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (1/1) ... [2025-03-03 14:26:16,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:16,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:16,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:16,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:16,224 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:16,224 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:16,224 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:16,224 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:16,224 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:16,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:16,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:16,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:16,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:16,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:16,225 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:16,225 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:16,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:16,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:16,390 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:16,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:16,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-03 14:26:16,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-03 14:26:16,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2692-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~40#1; [2025-03-03 14:26:16,591 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-03-03 14:26:16,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1104: #res := ~retValue_acc~9; [2025-03-03 14:26:16,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2423-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-03 14:26:16,651 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: #res#1 := ~retValue_acc~37#1; [2025-03-03 14:26:16,685 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-03 14:26:16,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1219: #res := ~retValue_acc~12; [2025-03-03 14:26:16,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-03 14:26:16,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-03 14:26:16,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-03 14:26:16,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1709-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-03 14:26:16,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-03 14:26:16,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-03 14:26:16,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: #res := ~retValue_acc~13; [2025-03-03 14:26:16,968 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:16,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:16,984 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:16,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:16,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:16 BoogieIcfgContainer [2025-03-03 14:26:16,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:16,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:16,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:16,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:16,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:15" (1/3) ... [2025-03-03 14:26:16,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150157ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:16, skipping insertion in model container [2025-03-03 14:26:16,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:16" (2/3) ... [2025-03-03 14:26:16,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150157ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:16, skipping insertion in model container [2025-03-03 14:26:16,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:16" (3/3) ... [2025-03-03 14:26:16,994 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product12.cil.c [2025-03-03 14:26:17,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:17,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product12.cil.c that has 16 procedures, 261 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:17,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:17,072 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;@4ea15806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:17,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 205 states have (on average 1.551219512195122) internal successors, (318), 209 states have internal predecessors, (318), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 14:26:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:26:17,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:17,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:17,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1172200157, now seen corresponding path program 1 times [2025-03-03 14:26:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469721239] [2025-03-03 14:26:17,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:17,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:26:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:26:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469721239] [2025-03-03 14:26:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469721239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988819210] [2025-03-03 14:26:17,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:17,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:17,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:17,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:26:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:26:17,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:26:17,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:17,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:17,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:26:17,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:17,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988819210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:26:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476844348] [2025-03-03 14:26:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:17,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:17,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:17,941 INFO L87 Difference]: Start difference. First operand has 261 states, 205 states have (on average 1.551219512195122) internal successors, (318), 209 states have internal predecessors, (318), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:17,973 INFO L93 Difference]: Finished difference Result 374 states and 556 transitions. [2025-03-03 14:26:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:17,974 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-03 14:26:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:17,981 INFO L225 Difference]: With dead ends: 374 [2025-03-03 14:26:17,981 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 14:26:17,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-03-03 14:26:17,986 INFO L435 NwaCegarLoop]: 393 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, 393 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-03-03 14:26:17,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 14:26:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-03 14:26:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:26:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-03-03 14:26:18,037 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2025-03-03 14:26:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-03-03 14:26:18,039 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-03-03 14:26:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:26:18,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:18,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-03-03 14:26:18,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:26:18,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:26:18,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 146674226, now seen corresponding path program 1 times [2025-03-03 14:26:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193944053] [2025-03-03 14:26:18,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:26:18,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:26:18,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:18,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:18,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193944053] [2025-03-03 14:26:18,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193944053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:18,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525400949] [2025-03-03 14:26:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:18,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:18,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:26:18,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:26:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:26:18,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:18,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:18,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:18,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:18,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525400949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:18,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:18,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603584962] [2025-03-03 14:26:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:18,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:18,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:18,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:18,709 INFO L87 Difference]: Start difference. First operand 254 states and 385 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:18,747 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2025-03-03 14:26:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:18,749 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-03 14:26:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:18,753 INFO L225 Difference]: With dead ends: 363 [2025-03-03 14:26:18,754 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 14:26:18,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-03-03 14:26:18,756 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 766 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-03-03 14:26:18,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 766 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 14:26:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-03 14:26:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5422885572139304) internal successors, (310), 204 states have internal predecessors, (310), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:26:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2025-03-03 14:26:18,774 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 87 [2025-03-03 14:26:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:18,774 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2025-03-03 14:26:18,774 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2025-03-03 14:26:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:26:18,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:18,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:18,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:18,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:26:18,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash -875651374, now seen corresponding path program 1 times [2025-03-03 14:26:18,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164884623] [2025-03-03 14:26:18,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:18,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:26:19,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:26:19,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164884623] [2025-03-03 14:26:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164884623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16670218] [2025-03-03 14:26:19,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:19,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:19,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:19,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:26:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:26:19,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:26:19,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:19,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:19,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:19,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:19,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:19,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16670218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:19,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916071453] [2025-03-03 14:26:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:19,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:19,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:19,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:19,421 INFO L87 Difference]: Start difference. First operand 256 states and 387 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:19,456 INFO L93 Difference]: Finished difference Result 536 states and 824 transitions. [2025-03-03 14:26:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:19,457 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-03 14:26:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:19,459 INFO L225 Difference]: With dead ends: 536 [2025-03-03 14:26:19,459 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 14:26:19,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-03-03 14:26:19,460 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 99 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 733 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-03-03 14:26:19,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 733 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 14:26:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2025-03-03 14:26:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 233 states have (on average 1.55793991416309) internal successors, (363), 236 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:26:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2025-03-03 14:26:19,492 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 92 [2025-03-03 14:26:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:19,493 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2025-03-03 14:26:19,493 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2025-03-03 14:26:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:26:19,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:19,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-03-03 14:26:19,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:19,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:19,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2127661779, now seen corresponding path program 1 times [2025-03-03 14:26:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302622403] [2025-03-03 14:26:19,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:19,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:26:19,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:26:19,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:19,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:19,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:19,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302622403] [2025-03-03 14:26:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302622403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:19,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127478558] [2025-03-03 14:26:19,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:19,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:19,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:19,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:26:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:26:20,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:26:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:20,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:26:20,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:20,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127478558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:26:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898508539] [2025-03-03 14:26:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:20,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:20,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:20,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:20,135 INFO L87 Difference]: Start difference. First operand 299 states and 462 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:20,189 INFO L93 Difference]: Finished difference Result 589 states and 914 transitions. [2025-03-03 14:26:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:20,190 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-03 14:26:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:20,192 INFO L225 Difference]: With dead ends: 589 [2025-03-03 14:26:20,193 INFO L226 Difference]: Without dead ends: 301 [2025-03-03 14:26:20,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 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-03-03 14:26:20,195 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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-03-03 14:26:20,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-03 14:26:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-03-03 14:26:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 238 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-03-03 14:26:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 465 transitions. [2025-03-03 14:26:20,214 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 465 transitions. Word has length 93 [2025-03-03 14:26:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:20,214 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 465 transitions. [2025-03-03 14:26:20,214 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 465 transitions. [2025-03-03 14:26:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:26:20,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:20,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 14:26:20,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:26:20,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:20,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -607799003, now seen corresponding path program 1 times [2025-03-03 14:26:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495230892] [2025-03-03 14:26:20,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:20,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:26:20,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:26:20,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:20,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:26:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495230892] [2025-03-03 14:26:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495230892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042601309] [2025-03-03 14:26:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:20,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:20,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:20,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:20,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:26:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:26:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:26:20,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:20,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:26:20,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:20,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042601309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:26:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378551060] [2025-03-03 14:26:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:20,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:20,854 INFO L87 Difference]: Start difference. First operand 301 states and 465 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:20,915 INFO L93 Difference]: Finished difference Result 591 states and 919 transitions. [2025-03-03 14:26:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:20,917 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-03 14:26:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:20,919 INFO L225 Difference]: With dead ends: 591 [2025-03-03 14:26:20,919 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:26:20,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 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-03-03 14:26:20,920 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 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-03-03 14:26:20,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:26:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:26:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-03-03 14:26:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 471 transitions. [2025-03-03 14:26:20,937 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 471 transitions. Word has length 94 [2025-03-03 14:26:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 471 transitions. [2025-03-03 14:26:20,937 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 471 transitions. [2025-03-03 14:26:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 14:26:20,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:20,940 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:20,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:26:21,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:21,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 44835420, now seen corresponding path program 1 times [2025-03-03 14:26:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063088220] [2025-03-03 14:26:21,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 14:26:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 14:26:21,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063088220] [2025-03-03 14:26:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063088220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626539140] [2025-03-03 14:26:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:21,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:21,256 INFO L87 Difference]: Start difference. First operand 303 states and 471 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:21,285 INFO L93 Difference]: Finished difference Result 583 states and 910 transitions. [2025-03-03 14:26:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:21,286 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2025-03-03 14:26:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:21,288 INFO L225 Difference]: With dead ends: 583 [2025-03-03 14:26:21,288 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:26:21,289 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-03-03 14:26:21,289 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1501 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-03-03 14:26:21,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1501 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:26:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:26:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-03-03 14:26:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 470 transitions. [2025-03-03 14:26:21,300 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 470 transitions. Word has length 95 [2025-03-03 14:26:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:21,300 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 470 transitions. [2025-03-03 14:26:21,300 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 470 transitions. [2025-03-03 14:26:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:26:21,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,302 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-03 14:26:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:26:21,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1573493046, now seen corresponding path program 2 times [2025-03-03 14:26:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215050153] [2025-03-03 14:26:21,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-03 14:26:21,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:26:21,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:26:21,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215050153] [2025-03-03 14:26:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215050153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213847258] [2025-03-03 14:26:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:21,403 INFO L87 Difference]: Start difference. First operand 303 states and 470 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:21,457 INFO L93 Difference]: Finished difference Result 581 states and 905 transitions. [2025-03-03 14:26:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:21,458 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), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2025-03-03 14:26:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:21,460 INFO L225 Difference]: With dead ends: 581 [2025-03-03 14:26:21,460 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:26:21,461 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-03-03 14:26:21,461 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:21,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1487 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:26:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:26:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-03 14:26:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 469 transitions. [2025-03-03 14:26:21,476 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 469 transitions. Word has length 96 [2025-03-03 14:26:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:21,476 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 469 transitions. [2025-03-03 14:26:21,476 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), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:26:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 469 transitions. [2025-03-03 14:26:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:26:21,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,478 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] [2025-03-03 14:26:21,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:26:21,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2059945359, now seen corresponding path program 3 times [2025-03-03 14:26:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412892640] [2025-03-03 14:26:21,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:26:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 3 equivalence classes. [2025-03-03 14:26:21,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 85 of 97 statements. [2025-03-03 14:26:21,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:26:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:26:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412892640] [2025-03-03 14:26:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412892640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515688003] [2025-03-03 14:26:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:21,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:21,573 INFO L87 Difference]: Start difference. First operand 303 states and 469 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:21,587 INFO L93 Difference]: Finished difference Result 454 states and 684 transitions. [2025-03-03 14:26:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-03-03 14:26:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:21,589 INFO L225 Difference]: With dead ends: 454 [2025-03-03 14:26:21,589 INFO L226 Difference]: Without dead ends: 352 [2025-03-03 14:26:21,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-03 14:26:21,590 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 279 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 517 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-03-03 14:26:21,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 517 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-03 14:26:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-03 14:26:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 275 states have (on average 1.5527272727272727) internal successors, (427), 280 states have internal predecessors, (427), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (58), 53 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-03 14:26:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 539 transitions. [2025-03-03 14:26:21,614 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 539 transitions. Word has length 97 [2025-03-03 14:26:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 539 transitions. [2025-03-03 14:26:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:26:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 539 transitions. [2025-03-03 14:26:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:26:21,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:26:21,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 780258127, now seen corresponding path program 1 times [2025-03-03 14:26:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721475607] [2025-03-03 14:26:21,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:26:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:26:21,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:26:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721475607] [2025-03-03 14:26:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721475607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714143449] [2025-03-03 14:26:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:21,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:21,757 INFO L87 Difference]: Start difference. First operand 352 states and 539 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:26:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:21,794 INFO L93 Difference]: Finished difference Result 683 states and 1051 transitions. [2025-03-03 14:26:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-03-03 14:26:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:21,797 INFO L225 Difference]: With dead ends: 683 [2025-03-03 14:26:21,797 INFO L226 Difference]: Without dead ends: 354 [2025-03-03 14:26:21,798 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-03-03 14:26:21,798 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1500 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-03-03 14:26:21,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1500 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-03 14:26:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-03 14:26:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 276 states have (on average 1.5507246376811594) internal successors, (428), 282 states have internal predecessors, (428), 54 states have call successors, (54), 21 states have call predecessors, (54), 23 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2025-03-03 14:26:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 542 transitions. [2025-03-03 14:26:21,816 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 542 transitions. Word has length 151 [2025-03-03 14:26:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 542 transitions. [2025-03-03 14:26:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:26:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 542 transitions. [2025-03-03 14:26:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:26:21,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:21,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:26:21,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1483818106, now seen corresponding path program 1 times [2025-03-03 14:26:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528347517] [2025-03-03 14:26:21,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:26:21,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:26:21,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:26:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528347517] [2025-03-03 14:26:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528347517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:21,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:26:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753928139] [2025-03-03 14:26:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:26:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:26:21,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:21,980 INFO L87 Difference]: Start difference. First operand 354 states and 542 transitions. Second operand has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:26:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:22,104 INFO L93 Difference]: Finished difference Result 688 states and 1060 transitions. [2025-03-03 14:26:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:26:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 152 [2025-03-03 14:26:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:22,107 INFO L225 Difference]: With dead ends: 688 [2025-03-03 14:26:22,107 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 14:26:22,109 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-03-03 14:26:22,109 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 5 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:22,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2561 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 14:26:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-03 14:26:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 280 states have (on average 1.5464285714285715) internal successors, (433), 286 states have internal predecessors, (433), 54 states have call successors, (54), 22 states have call predecessors, (54), 24 states have return successors, (65), 53 states have call predecessors, (65), 53 states have call successors, (65) [2025-03-03 14:26:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 552 transitions. [2025-03-03 14:26:22,125 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 552 transitions. Word has length 152 [2025-03-03 14:26:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 552 transitions. [2025-03-03 14:26:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:26:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 552 transitions. [2025-03-03 14:26:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:26:22,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:22,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:22,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:26:22,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1074031422, now seen corresponding path program 1 times [2025-03-03 14:26:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895815747] [2025-03-03 14:26:22,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:22,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:26:22,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:26:22,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895815747] [2025-03-03 14:26:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895815747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827691518] [2025-03-03 14:26:22,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:22,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:26:22,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:26:22,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:26:22,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:22,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 14:26:22,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827691518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:22,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:26:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170960763] [2025-03-03 14:26:22,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:26:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:26:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:26:22,679 INFO L87 Difference]: Start difference. First operand 359 states and 552 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:22,795 INFO L93 Difference]: Finished difference Result 837 states and 1335 transitions. [2025-03-03 14:26:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:26:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-03-03 14:26:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:22,799 INFO L225 Difference]: With dead ends: 837 [2025-03-03 14:26:22,799 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 14:26:22,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 303 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-03-03 14:26:22,800 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 375 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:22,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1390 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 14:26:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 657. [2025-03-03 14:26:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 514 states have (on average 1.6070038910505837) internal successors, (826), 520 states have internal predecessors, (826), 118 states have call successors, (118), 22 states have call predecessors, (118), 24 states have return successors, (139), 117 states have call predecessors, (139), 117 states have call successors, (139) [2025-03-03 14:26:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1083 transitions. [2025-03-03 14:26:22,826 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1083 transitions. Word has length 153 [2025-03-03 14:26:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:22,826 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1083 transitions. [2025-03-03 14:26:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1083 transitions. [2025-03-03 14:26:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:26:22,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:22,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:22,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:23,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1146041790, now seen corresponding path program 1 times [2025-03-03 14:26:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460783097] [2025-03-03 14:26:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:26:23,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:26:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:23,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460783097] [2025-03-03 14:26:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460783097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168725542] [2025-03-03 14:26:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:23,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:23,102 INFO L87 Difference]: Start difference. First operand 657 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,139 INFO L93 Difference]: Finished difference Result 1548 states and 2591 transitions. [2025-03-03 14:26:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:23,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 159 [2025-03-03 14:26:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,146 INFO L225 Difference]: With dead ends: 1548 [2025-03-03 14:26:23,146 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 14:26:23,149 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-03-03 14:26:23,150 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 97 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 779 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-03-03 14:26:23,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 14:26:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2025-03-03 14:26:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.6187919463087248) internal successors, (1206), 751 states have internal predecessors, (1206), 182 states have call successors, (182), 22 states have call predecessors, (182), 24 states have return successors, (213), 181 states have call predecessors, (213), 181 states have call successors, (213) [2025-03-03 14:26:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1601 transitions. [2025-03-03 14:26:23,205 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1601 transitions. Word has length 159 [2025-03-03 14:26:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,206 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1601 transitions. [2025-03-03 14:26:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1601 transitions. [2025-03-03 14:26:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:26:23,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:26:23,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -247476034, now seen corresponding path program 1 times [2025-03-03 14:26:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237580783] [2025-03-03 14:26:23,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:26:23,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:26:23,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237580783] [2025-03-03 14:26:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237580783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557025329] [2025-03-03 14:26:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:23,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:23,289 INFO L87 Difference]: Start difference. First operand 952 states and 1601 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,338 INFO L93 Difference]: Finished difference Result 2252 states and 3809 transitions. [2025-03-03 14:26:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:23,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-03 14:26:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,347 INFO L225 Difference]: With dead ends: 2252 [2025-03-03 14:26:23,348 INFO L226 Difference]: Without dead ends: 1420 [2025-03-03 14:26:23,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-03-03 14:26:23,351 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 95 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 762 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-03-03 14:26:23,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-03 14:26:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1412. [2025-03-03 14:26:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1110 states have (on average 1.6261261261261262) internal successors, (1805), 1116 states have internal predecessors, (1805), 277 states have call successors, (277), 22 states have call predecessors, (277), 24 states have return successors, (308), 276 states have call predecessors, (308), 276 states have call successors, (308) [2025-03-03 14:26:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2390 transitions. [2025-03-03 14:26:23,421 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2390 transitions. Word has length 160 [2025-03-03 14:26:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,421 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2390 transitions. [2025-03-03 14:26:23,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2390 transitions. [2025-03-03 14:26:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:26:23,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:23,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:26:23,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash -6814271, now seen corresponding path program 1 times [2025-03-03 14:26:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263423946] [2025-03-03 14:26:23,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:26:23,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:26:23,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263423946] [2025-03-03 14:26:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263423946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702725301] [2025-03-03 14:26:23,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:23,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:23,516 INFO L87 Difference]: Start difference. First operand 1412 states and 2390 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,591 INFO L93 Difference]: Finished difference Result 3281 states and 5598 transitions. [2025-03-03 14:26:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-03 14:26:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,604 INFO L225 Difference]: With dead ends: 3281 [2025-03-03 14:26:23,604 INFO L226 Difference]: Without dead ends: 2111 [2025-03-03 14:26:23,609 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-03-03 14:26:23,610 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 93 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 757 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-03-03 14:26:23,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2025-03-03 14:26:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2103. [2025-03-03 14:26:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1678 states have (on average 1.632300357568534) internal successors, (2739), 1684 states have internal predecessors, (2739), 400 states have call successors, (400), 22 states have call predecessors, (400), 24 states have return successors, (447), 399 states have call predecessors, (447), 399 states have call successors, (447) [2025-03-03 14:26:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3586 transitions. [2025-03-03 14:26:23,708 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 3586 transitions. Word has length 161 [2025-03-03 14:26:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,709 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 3586 transitions. [2025-03-03 14:26:23,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 3586 transitions. [2025-03-03 14:26:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:26:23,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:23,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:26:23,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2106180897, now seen corresponding path program 1 times [2025-03-03 14:26:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857571007] [2025-03-03 14:26:23,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:26:23,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:26:23,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857571007] [2025-03-03 14:26:23,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857571007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:23,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466679270] [2025-03-03 14:26:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:23,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:23,798 INFO L87 Difference]: Start difference. First operand 2103 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,926 INFO L93 Difference]: Finished difference Result 4869 states and 8364 transitions. [2025-03-03 14:26:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2025-03-03 14:26:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,945 INFO L225 Difference]: With dead ends: 4869 [2025-03-03 14:26:23,945 INFO L226 Difference]: Without dead ends: 3208 [2025-03-03 14:26:23,953 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-03-03 14:26:23,953 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 91 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 757 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-03-03 14:26:23,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-03 14:26:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3200. [2025-03-03 14:26:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 2596 states have (on average 1.6363636363636365) internal successors, (4248), 2602 states have internal predecessors, (4248), 579 states have call successors, (579), 22 states have call predecessors, (579), 24 states have return successors, (652), 578 states have call predecessors, (652), 578 states have call successors, (652) [2025-03-03 14:26:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 5479 transitions. [2025-03-03 14:26:24,128 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 5479 transitions. Word has length 162 [2025-03-03 14:26:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,128 INFO L471 AbstractCegarLoop]: Abstraction has 3200 states and 5479 transitions. [2025-03-03 14:26:24,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 5479 transitions. [2025-03-03 14:26:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:26:24,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:26:24,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1951339936, now seen corresponding path program 1 times [2025-03-03 14:26:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954748858] [2025-03-03 14:26:24,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:26:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:26:24,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954748858] [2025-03-03 14:26:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954748858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:24,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:24,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906025287] [2025-03-03 14:26:24,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:24,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:24,218 INFO L87 Difference]: Start difference. First operand 3200 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:24,400 INFO L93 Difference]: Finished difference Result 7731 states and 13307 transitions. [2025-03-03 14:26:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-03 14:26:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:24,430 INFO L225 Difference]: With dead ends: 7731 [2025-03-03 14:26:24,430 INFO L226 Difference]: Without dead ends: 5200 [2025-03-03 14:26:24,441 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-03-03 14:26:24,441 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 89 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 777 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-03-03 14:26:24,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 777 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-03 14:26:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5192. [2025-03-03 14:26:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5192 states, 4212 states have (on average 1.628917378917379) internal successors, (6861), 4218 states have internal predecessors, (6861), 955 states have call successors, (955), 22 states have call predecessors, (955), 24 states have return successors, (1072), 954 states have call predecessors, (1072), 954 states have call successors, (1072) [2025-03-03 14:26:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 8888 transitions. [2025-03-03 14:26:24,743 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 8888 transitions. Word has length 163 [2025-03-03 14:26:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 5192 states and 8888 transitions. [2025-03-03 14:26:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 8888 transitions. [2025-03-03 14:26:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:26:24,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:24,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:26:24,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash 130858048, now seen corresponding path program 1 times [2025-03-03 14:26:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779923186] [2025-03-03 14:26:24,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:26:24,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:26:24,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779923186] [2025-03-03 14:26:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779923186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090729629] [2025-03-03 14:26:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:24,830 INFO L87 Difference]: Start difference. First operand 5192 states and 8888 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,082 INFO L93 Difference]: Finished difference Result 12768 states and 22000 transitions. [2025-03-03 14:26:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 14:26:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,126 INFO L225 Difference]: With dead ends: 12768 [2025-03-03 14:26:25,126 INFO L226 Difference]: Without dead ends: 8616 [2025-03-03 14:26:25,140 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-03-03 14:26:25,141 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 87 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 760 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-03-03 14:26:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2025-03-03 14:26:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 8608. [2025-03-03 14:26:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8608 states, 7022 states have (on average 1.626744517231558) internal successors, (11423), 7028 states have internal predecessors, (11423), 1561 states have call successors, (1561), 22 states have call predecessors, (1561), 24 states have return successors, (1756), 1560 states have call predecessors, (1756), 1560 states have call successors, (1756) [2025-03-03 14:26:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8608 states to 8608 states and 14740 transitions. [2025-03-03 14:26:25,596 INFO L78 Accepts]: Start accepts. Automaton has 8608 states and 14740 transitions. Word has length 164 [2025-03-03 14:26:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,596 INFO L471 AbstractCegarLoop]: Abstraction has 8608 states and 14740 transitions. [2025-03-03 14:26:25,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states and 14740 transitions. [2025-03-03 14:26:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:26:25,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:26:25,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1600682337, now seen corresponding path program 1 times [2025-03-03 14:26:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242840002] [2025-03-03 14:26:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:26:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:26:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242840002] [2025-03-03 14:26:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242840002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217769619] [2025-03-03 14:26:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:25,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:25,715 INFO L87 Difference]: Start difference. First operand 8608 states and 14740 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,140 INFO L93 Difference]: Finished difference Result 22225 states and 38223 transitions. [2025-03-03 14:26:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-03 14:26:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,203 INFO L225 Difference]: With dead ends: 22225 [2025-03-03 14:26:26,203 INFO L226 Difference]: Without dead ends: 15072 [2025-03-03 14:26:26,229 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-03-03 14:26:26,230 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 85 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 766 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-03-03 14:26:26,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 766 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15072 states. [2025-03-03 14:26:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15072 to 15064. [2025-03-03 14:26:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15064 states, 12275 states have (on average 1.6172708757637475) internal successors, (19852), 12281 states have internal predecessors, (19852), 2764 states have call successors, (2764), 22 states have call predecessors, (2764), 24 states have return successors, (3103), 2763 states have call predecessors, (3103), 2763 states have call successors, (3103) [2025-03-03 14:26:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15064 states to 15064 states and 25719 transitions. [2025-03-03 14:26:26,851 INFO L78 Accepts]: Start accepts. Automaton has 15064 states and 25719 transitions. Word has length 165 [2025-03-03 14:26:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,852 INFO L471 AbstractCegarLoop]: Abstraction has 15064 states and 25719 transitions. [2025-03-03 14:26:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15064 states and 25719 transitions. [2025-03-03 14:26:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:26:26,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:26,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:26:26,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1958093215, now seen corresponding path program 1 times [2025-03-03 14:26:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524482482] [2025-03-03 14:26:26,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:26:26,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:26:26,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524482482] [2025-03-03 14:26:26,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524482482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:26,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847848483] [2025-03-03 14:26:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:26,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,982 INFO L87 Difference]: Start difference. First operand 15064 states and 25719 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,774 INFO L93 Difference]: Finished difference Result 39786 states and 68271 transitions. [2025-03-03 14:26:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-03 14:26:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,923 INFO L225 Difference]: With dead ends: 39786 [2025-03-03 14:26:27,924 INFO L226 Difference]: Without dead ends: 26776 [2025-03-03 14:26:27,978 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-03-03 14:26:27,979 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 83 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 760 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2025-03-03 14:26:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 26768. [2025-03-03 14:26:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26768 states, 21940 states have (on average 1.6132178669097539) internal successors, (35394), 21946 states have internal predecessors, (35394), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-03 14:26:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26768 states to 26768 states and 45613 transitions. [2025-03-03 14:26:29,412 INFO L78 Accepts]: Start accepts. Automaton has 26768 states and 45613 transitions. Word has length 166 [2025-03-03 14:26:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,412 INFO L471 AbstractCegarLoop]: Abstraction has 26768 states and 45613 transitions. [2025-03-03 14:26:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 26768 states and 45613 transitions. [2025-03-03 14:26:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:26:29,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:29,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:26:29,500 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 850586110, now seen corresponding path program 1 times [2025-03-03 14:26:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647449465] [2025-03-03 14:26:29,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:26:29,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:26:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647449465] [2025-03-03 14:26:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647449465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808637189] [2025-03-03 14:26:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:29,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:29,565 INFO L87 Difference]: Start difference. First operand 26768 states and 45613 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:30,526 INFO L93 Difference]: Finished difference Result 72793 states and 124558 transitions. [2025-03-03 14:26:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-03 14:26:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:30,742 INFO L225 Difference]: With dead ends: 72793 [2025-03-03 14:26:30,743 INFO L226 Difference]: Without dead ends: 48802 [2025-03-03 14:26:30,811 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-03-03 14:26:30,814 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 81 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 762 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-03-03 14:26:30,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48802 states. [2025-03-03 14:26:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48802 to 48794. [2025-03-03 14:26:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48794 states, 40251 states have (on average 1.6077116096494497) internal successors, (64712), 40257 states have internal predecessors, (64712), 8518 states have call successors, (8518), 22 states have call predecessors, (8518), 24 states have return successors, (9663), 8517 states have call predecessors, (9663), 8517 states have call successors, (9663) [2025-03-03 14:26:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48794 states to 48794 states and 82893 transitions. [2025-03-03 14:26:32,892 INFO L78 Accepts]: Start accepts. Automaton has 48794 states and 82893 transitions. Word has length 167 [2025-03-03 14:26:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 48794 states and 82893 transitions. [2025-03-03 14:26:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 48794 states and 82893 transitions. [2025-03-03 14:26:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:26:33,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:33,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:26:33,028 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -407053022, now seen corresponding path program 1 times [2025-03-03 14:26:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896780550] [2025-03-03 14:26:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:26:33,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:26:33,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:33,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896780550] [2025-03-03 14:26:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896780550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:33,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:33,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226284821] [2025-03-03 14:26:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:33,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:33,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:33,110 INFO L87 Difference]: Start difference. First operand 48794 states and 82893 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:35,044 INFO L93 Difference]: Finished difference Result 90769 states and 154610 transitions. [2025-03-03 14:26:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 168 [2025-03-03 14:26:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:35,434 INFO L225 Difference]: With dead ends: 90769 [2025-03-03 14:26:35,434 INFO L226 Difference]: Without dead ends: 90613 [2025-03-03 14:26:35,476 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-03-03 14:26:35,478 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 76 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:35,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 774 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90613 states. [2025-03-03 14:26:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90613 to 90605. [2025-03-03 14:26:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90605 states, 75263 states have (on average 1.600587273959316) internal successors, (120465), 75269 states have internal predecessors, (120465), 15317 states have call successors, (15317), 22 states have call predecessors, (15317), 24 states have return successors, (17508), 15316 states have call predecessors, (17508), 15316 states have call successors, (17508) [2025-03-03 14:26:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90605 states to 90605 states and 153290 transitions. [2025-03-03 14:26:38,766 INFO L78 Accepts]: Start accepts. Automaton has 90605 states and 153290 transitions. Word has length 168 [2025-03-03 14:26:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:38,767 INFO L471 AbstractCegarLoop]: Abstraction has 90605 states and 153290 transitions. [2025-03-03 14:26:38,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:26:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 90605 states and 153290 transitions. [2025-03-03 14:26:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:26:38,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:38,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:26:38,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -878527203, now seen corresponding path program 1 times [2025-03-03 14:26:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547783049] [2025-03-03 14:26:38,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:38,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:26:38,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:26:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:26:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:39,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547783049] [2025-03-03 14:26:39,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547783049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:39,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424954184] [2025-03-03 14:26:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:39,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:39,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:39,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:26:39,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:26:39,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:26:39,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:39,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:39,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:26:39,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:26:40,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:26:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424954184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:40,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:40,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-03-03 14:26:40,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369447543] [2025-03-03 14:26:40,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:40,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:26:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:40,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:26:40,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:26:40,851 INFO L87 Difference]: Start difference. First operand 90605 states and 153290 transitions. Second operand has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-03 14:26:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:45,807 INFO L93 Difference]: Finished difference Result 180859 states and 311406 transitions. [2025-03-03 14:26:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 14:26:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) Word has length 169 [2025-03-03 14:26:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:46,607 INFO L225 Difference]: With dead ends: 180859 [2025-03-03 14:26:46,607 INFO L226 Difference]: Without dead ends: 180720 [2025-03-03 14:26:46,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 14:26:46,698 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1442 mSDsluCounter, 9093 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 9711 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:46,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 9711 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:26:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180720 states. [2025-03-03 14:26:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180720 to 180620. [2025-03-03 14:26:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180620 states, 150106 states have (on average 1.6014283239843843) internal successors, (240384), 150013 states have internal predecessors, (240384), 30436 states have call successors, (30436), 69 states have call predecessors, (30436), 77 states have return successors, (38094), 30549 states have call predecessors, (38094), 30432 states have call successors, (38094) [2025-03-03 14:26:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180620 states to 180620 states and 308914 transitions. [2025-03-03 14:26:53,903 INFO L78 Accepts]: Start accepts. Automaton has 180620 states and 308914 transitions. Word has length 169 [2025-03-03 14:26:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 180620 states and 308914 transitions. [2025-03-03 14:26:53,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-03 14:26:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 180620 states and 308914 transitions. [2025-03-03 14:26:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:26:54,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:54,587 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:26:54,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:26:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:54,791 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 376134540, now seen corresponding path program 1 times [2025-03-03 14:26:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135890912] [2025-03-03 14:26:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:54,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:26:54,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:26:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:26:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135890912] [2025-03-03 14:26:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135890912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:26:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612107865] [2025-03-03 14:26:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:26:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:54,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:26:54,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:26:54,886 INFO L87 Difference]: Start difference. First operand 180620 states and 308914 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)