./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec0_product11.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 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:18,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:18,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:18,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:18,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:18,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:18,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:18,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:18,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:18,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:18,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:18,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:18,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:18,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:18,651 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:18,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:18,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:18,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:18,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:18,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:18,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:18,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:18,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:18,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:18,655 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 -> 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 [2025-03-08 05:29:18,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:18,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:18,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:18,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:18,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:18,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-03-08 05:29:20,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1e2a01c/743ba59113d34d16b011998622c4b745/FLAG2401bca1b [2025-03-08 05:29:20,358 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:20,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-03-08 05:29:20,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1e2a01c/743ba59113d34d16b011998622c4b745/FLAG2401bca1b [2025-03-08 05:29:20,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c1e2a01c/743ba59113d34d16b011998622c4b745 [2025-03-08 05:29:20,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:20,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:20,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:20,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:20,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:20,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:20" (1/1) ... [2025-03-08 05:29:20,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4793bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:20, skipping insertion in model container [2025-03-08 05:29:20,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:20" (1/1) ... [2025-03-08 05:29:20,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:21,069 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_spec0_product11.cil.c[59717,59730] [2025-03-08 05:29:21,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:21,084 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:21,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:29:21,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-03-08 05:29:21,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [576] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [876] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [896] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1262] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1478] [2025-03-08 05:29:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1671] [2025-03-08 05:29:21,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2740] [2025-03-08 05:29:21,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2749] [2025-03-08 05:29:21,178 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_spec0_product11.cil.c[59717,59730] [2025-03-08 05:29:21,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:21,202 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:21,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21 WrapperNode [2025-03-08 05:29:21,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:21,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:21,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:21,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:21,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,248 INFO L138 Inliner]: procedures = 121, calls = 162, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 796 [2025-03-08 05:29:21,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:21,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:21,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:21,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:21,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,276 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-08 05:29:21,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:21,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:21,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:21,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:21,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (1/1) ... [2025-03-08 05:29:21,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:21,345 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-08 05:29:21,348 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-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:29:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:29:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:29:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:29:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:21,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:21,488 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:21,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2670-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~40#1; [2025-03-08 05:29:21,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717-1: getClientId_#res#1 := getClientId_~retValue_acc~41#1; [2025-03-08 05:29:21,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~2#1; [2025-03-08 05:29:21,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:29:21,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:29:21,653 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2329-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~35#1; [2025-03-08 05:29:21,653 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: #res#1 := ~retValue_acc~36#1; [2025-03-08 05:29:21,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L573-1: createEmail_#res#1 := createEmail_~retValue_acc~15#1; [2025-03-08 05:29:21,948 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:29:21,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1601-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-03-08 05:29:21,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1610-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-03-08 05:29:21,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-03-08 05:29:21,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~38#1; [2025-03-08 05:29:21,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~37#1; [2025-03-08 05:29:21,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L549: #res := ~retValue_acc~13; [2025-03-08 05:29:22,038 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:22,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:22,052 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:22,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:22,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:22 BoogieIcfgContainer [2025-03-08 05:29:22,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:22,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:22,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:22,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:22,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:20" (1/3) ... [2025-03-08 05:29:22,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1934d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:22, skipping insertion in model container [2025-03-08 05:29:22,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:21" (2/3) ... [2025-03-08 05:29:22,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1934d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:22, skipping insertion in model container [2025-03-08 05:29:22,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:22" (3/3) ... [2025-03-08 05:29:22,063 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product11.cil.c [2025-03-08 05:29:22,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:22,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product11.cil.c that has 14 procedures, 233 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:22,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:22,139 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;@5ffd62d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:22,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 183 states have (on average 1.530054644808743) internal successors, (280), 185 states have internal predecessors, (280), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 05:29:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:29:22,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:22,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:22,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 992303297, now seen corresponding path program 1 times [2025-03-08 05:29:22,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:22,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566471515] [2025-03-08 05:29:22,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:22,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:29:22,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:29:22,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:22,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:29:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:22,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566471515] [2025-03-08 05:29:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566471515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119141584] [2025-03-08 05:29:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:22,745 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-08 05:29:22,747 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-08 05:29:22,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:29:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:29:22,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:22,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:23,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:23,036 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-08 05:29:23,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:23,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119141584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:23,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:23,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250734393] [2025-03-08 05:29:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:23,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:23,061 INFO L87 Difference]: Start difference. First operand has 233 states, 183 states have (on average 1.530054644808743) internal successors, (280), 185 states have internal predecessors, (280), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:23,101 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2025-03-08 05:29:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:23,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2025-03-08 05:29:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:23,110 INFO L225 Difference]: With dead ends: 315 [2025-03-08 05:29:23,111 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 05:29:23,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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-08 05:29:23,116 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 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-08 05:29:23,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 05:29:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-08 05:29:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 178 states have (on average 1.5224719101123596) internal successors, (271), 179 states have internal predecessors, (271), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 05:29:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 340 transitions. [2025-03-08 05:29:23,164 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 340 transitions. Word has length 93 [2025-03-08 05:29:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:23,165 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 340 transitions. [2025-03-08 05:29:23,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 340 transitions. [2025-03-08 05:29:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:29:23,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:23,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:23,185 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-08 05:29:23,377 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-08 05:29:23,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 533158521, now seen corresponding path program 1 times [2025-03-08 05:29:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89628287] [2025-03-08 05:29:23,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:29:23,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:29:23,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:29:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89628287] [2025-03-08 05:29:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89628287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907319045] [2025-03-08 05:29:23,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:23,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:23,612 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-08 05:29:23,613 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-08 05:29:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:29:23,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:29:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:23,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:29:23,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907319045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:23,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:23,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120279626] [2025-03-08 05:29:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:23,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:23,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:23,874 INFO L87 Difference]: Start difference. First operand 227 states and 340 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:23,909 INFO L93 Difference]: Finished difference Result 483 states and 738 transitions. [2025-03-08 05:29:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:23,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2025-03-08 05:29:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:23,914 INFO L225 Difference]: With dead ends: 483 [2025-03-08 05:29:23,915 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 05:29:23,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-08 05:29:23,919 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 107 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 647 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-08 05:29:23,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 647 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 05:29:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2025-03-08 05:29:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 214 states have (on average 1.5467289719626167) internal successors, (331), 215 states have internal predecessors, (331), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 05:29:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 422 transitions. [2025-03-08 05:29:23,944 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 422 transitions. Word has length 97 [2025-03-08 05:29:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:23,944 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 422 transitions. [2025-03-08 05:29:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2025-03-08 05:29:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:29:23,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:23,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:23,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:29:24,152 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-08 05:29:24,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 76285235, now seen corresponding path program 1 times [2025-03-08 05:29:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734603232] [2025-03-08 05:29:24,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:24,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:29:24,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:29:24,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:24,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:29:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734603232] [2025-03-08 05:29:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734603232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418191439] [2025-03-08 05:29:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:24,323 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-08 05:29:24,325 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-08 05:29:24,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:29:24,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:29:24,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:24,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:24,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:29:24,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:29:24,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418191439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016217471] [2025-03-08 05:29:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:24,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:24,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:24,604 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:24,653 INFO L93 Difference]: Finished difference Result 539 states and 834 transitions. [2025-03-08 05:29:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2025-03-08 05:29:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:24,657 INFO L225 Difference]: With dead ends: 539 [2025-03-08 05:29:24,657 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 05:29:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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-08 05:29:24,658 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1313 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-08 05:29:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1313 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 05:29:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-08 05:29:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 215 states have (on average 1.544186046511628) internal successors, (332), 217 states have internal predecessors, (332), 46 states have call successors, (46), 13 states have call predecessors, (46), 14 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2025-03-08 05:29:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 425 transitions. [2025-03-08 05:29:24,676 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 425 transitions. Word has length 98 [2025-03-08 05:29:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:24,676 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 425 transitions. [2025-03-08 05:29:24,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 425 transitions. [2025-03-08 05:29:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:29:24,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:24,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:24,688 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-08 05:29:24,880 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-08 05:29:24,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash -141545385, now seen corresponding path program 1 times [2025-03-08 05:29:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867414046] [2025-03-08 05:29:24,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:24,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:29:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:29:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:24,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867414046] [2025-03-08 05:29:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867414046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899924107] [2025-03-08 05:29:25,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:25,040 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-08 05:29:25,043 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-08 05:29:25,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:29:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:29:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:29:25,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:29:25,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899924107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:29:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263307465] [2025-03-08 05:29:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:25,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:25,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:25,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:25,288 INFO L87 Difference]: Start difference. First operand 276 states and 425 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:25,337 INFO L93 Difference]: Finished difference Result 541 states and 839 transitions. [2025-03-08 05:29:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:25,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2025-03-08 05:29:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:25,344 INFO L225 Difference]: With dead ends: 541 [2025-03-08 05:29:25,344 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 05:29:25,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 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-08 05:29:25,345 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 2 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1299 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-08 05:29:25,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1299 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 05:29:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-08 05:29:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 216 states have (on average 1.5416666666666667) internal successors, (333), 219 states have internal predecessors, (333), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2025-03-08 05:29:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 431 transitions. [2025-03-08 05:29:25,364 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 431 transitions. Word has length 99 [2025-03-08 05:29:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:25,365 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 431 transitions. [2025-03-08 05:29:25,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 431 transitions. [2025-03-08 05:29:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:29:25,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:25,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:25,375 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-08 05:29:25,569 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-08 05:29:25,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:25,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 49245059, now seen corresponding path program 1 times [2025-03-08 05:29:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476499592] [2025-03-08 05:29:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:25,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:29:25,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:29:25,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:29:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476499592] [2025-03-08 05:29:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476499592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:25,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738677540] [2025-03-08 05:29:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:25,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:25,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:25,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:25,693 INFO L87 Difference]: Start difference. First operand 278 states and 431 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:25,731 INFO L93 Difference]: Finished difference Result 533 states and 830 transitions. [2025-03-08 05:29:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-03-08 05:29:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:25,734 INFO L225 Difference]: With dead ends: 533 [2025-03-08 05:29:25,735 INFO L226 Difference]: Without dead ends: 278 [2025-03-08 05:29:25,737 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-08 05:29:25,738 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 2 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1317 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-08 05:29:25,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-08 05:29:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-08 05:29:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 216 states have (on average 1.5416666666666667) internal successors, (333), 219 states have internal predecessors, (333), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2025-03-08 05:29:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 430 transitions. [2025-03-08 05:29:25,751 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 430 transitions. Word has length 100 [2025-03-08 05:29:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:25,751 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 430 transitions. [2025-03-08 05:29:25,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 430 transitions. [2025-03-08 05:29:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:29:25,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:25,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:25,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:25,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -586230267, now seen corresponding path program 2 times [2025-03-08 05:29:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256444569] [2025-03-08 05:29:25,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:25,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-03-08 05:29:25,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 101 statements. [2025-03-08 05:29:25,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256444569] [2025-03-08 05:29:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256444569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:25,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:25,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233349484] [2025-03-08 05:29:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:25,834 INFO L87 Difference]: Start difference. First operand 278 states and 430 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:25,890 INFO L93 Difference]: Finished difference Result 599 states and 916 transitions. [2025-03-08 05:29:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:25,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-08 05:29:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:25,894 INFO L225 Difference]: With dead ends: 599 [2025-03-08 05:29:25,896 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 05:29:25,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:25,897 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 298 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:25,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1317 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 05:29:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2025-03-08 05:29:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 414 states have (on average 1.5579710144927537) internal successors, (645), 418 states have internal predecessors, (645), 86 states have call successors, (86), 25 states have call predecessors, (86), 27 states have return successors, (90), 84 states have call predecessors, (90), 84 states have call successors, (90) [2025-03-08 05:29:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 821 transitions. [2025-03-08 05:29:25,924 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 821 transitions. Word has length 101 [2025-03-08 05:29:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:25,925 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 821 transitions. [2025-03-08 05:29:25,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 821 transitions. [2025-03-08 05:29:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:29:25,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:25,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:29:25,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 918285929, now seen corresponding path program 1 times [2025-03-08 05:29:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104883738] [2025-03-08 05:29:25,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:25,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:29:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:29:25,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:29:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104883738] [2025-03-08 05:29:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104883738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170080354] [2025-03-08 05:29:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:26,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:26,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:26,044 INFO L87 Difference]: Start difference. First operand 528 states and 821 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:26,101 INFO L93 Difference]: Finished difference Result 1035 states and 1615 transitions. [2025-03-08 05:29:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-03-08 05:29:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:26,106 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 05:29:26,106 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 05:29:26,108 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-08 05:29:26,108 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1320 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-08 05:29:26,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1320 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 05:29:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 05:29:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 415 states have (on average 1.5566265060240965) internal successors, (646), 420 states have internal predecessors, (646), 86 states have call successors, (86), 25 states have call predecessors, (86), 28 states have return successors, (92), 84 states have call predecessors, (92), 84 states have call successors, (92) [2025-03-08 05:29:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 824 transitions. [2025-03-08 05:29:26,151 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 824 transitions. Word has length 102 [2025-03-08 05:29:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,152 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 824 transitions. [2025-03-08 05:29:26,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:29:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 824 transitions. [2025-03-08 05:29:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:29:26,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:26,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:29:26,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1450163346, now seen corresponding path program 1 times [2025-03-08 05:29:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704938658] [2025-03-08 05:29:26,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:29:26,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:29:26,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704938658] [2025-03-08 05:29:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704938658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:26,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334043250] [2025-03-08 05:29:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:26,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:26,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:26,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:26,271 INFO L87 Difference]: Start difference. First operand 530 states and 824 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:29:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:26,409 INFO L93 Difference]: Finished difference Result 1039 states and 1618 transitions. [2025-03-08 05:29:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2025-03-08 05:29:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:26,414 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 05:29:26,414 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:29:26,416 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-08 05:29:26,416 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 7 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:26,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2232 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:29:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2025-03-08 05:29:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 417 states have (on average 1.5539568345323742) internal successors, (648), 421 states have internal predecessors, (648), 86 states have call successors, (86), 26 states have call predecessors, (86), 28 states have return successors, (91), 84 states have call predecessors, (91), 84 states have call successors, (91) [2025-03-08 05:29:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 825 transitions. [2025-03-08 05:29:26,444 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 825 transitions. Word has length 103 [2025-03-08 05:29:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 825 transitions. [2025-03-08 05:29:26,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:29:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 825 transitions. [2025-03-08 05:29:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:29:26,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:29:26,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1946872710, now seen corresponding path program 2 times [2025-03-08 05:29:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852720630] [2025-03-08 05:29:26,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-08 05:29:26,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 104 statements. [2025-03-08 05:29:26,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:29:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852720630] [2025-03-08 05:29:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852720630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872338372] [2025-03-08 05:29:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:26,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:26,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:26,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:26,527 INFO L87 Difference]: Start difference. First operand 532 states and 825 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:26,583 INFO L93 Difference]: Finished difference Result 1176 states and 1793 transitions. [2025-03-08 05:29:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:26,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-08 05:29:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:26,590 INFO L225 Difference]: With dead ends: 1176 [2025-03-08 05:29:26,590 INFO L226 Difference]: Without dead ends: 1040 [2025-03-08 05:29:26,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:26,591 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 295 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:26,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-08 05:29:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1028. [2025-03-08 05:29:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 809 states have (on average 1.5673671199011125) internal successors, (1268), 815 states have internal predecessors, (1268), 166 states have call successors, (166), 50 states have call predecessors, (166), 52 states have return successors, (169), 162 states have call predecessors, (169), 162 states have call successors, (169) [2025-03-08 05:29:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1603 transitions. [2025-03-08 05:29:26,638 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1603 transitions. Word has length 104 [2025-03-08 05:29:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,639 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1603 transitions. [2025-03-08 05:29:26,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1603 transitions. [2025-03-08 05:29:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:29:26,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:29:26,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 902013007, now seen corresponding path program 1 times [2025-03-08 05:29:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090514399] [2025-03-08 05:29:26,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:29:26,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:29:26,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:26,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:26,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090514399] [2025-03-08 05:29:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090514399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373263590] [2025-03-08 05:29:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:26,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:26,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:26,764 INFO L87 Difference]: Start difference. First operand 1028 states and 1603 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:29:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:26,896 INFO L93 Difference]: Finished difference Result 2038 states and 3189 transitions. [2025-03-08 05:29:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:26,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-03-08 05:29:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:26,902 INFO L225 Difference]: With dead ends: 2038 [2025-03-08 05:29:26,902 INFO L226 Difference]: Without dead ends: 1037 [2025-03-08 05:29:26,905 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-08 05:29:26,905 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 5 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:26,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2246 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-08 05:29:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1031. [2025-03-08 05:29:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 811 states have (on average 1.56596794081381) internal successors, (1270), 818 states have internal predecessors, (1270), 166 states have call successors, (166), 50 states have call predecessors, (166), 53 states have return successors, (174), 162 states have call predecessors, (174), 162 states have call successors, (174) [2025-03-08 05:29:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1610 transitions. [2025-03-08 05:29:26,949 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1610 transitions. Word has length 105 [2025-03-08 05:29:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:26,950 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1610 transitions. [2025-03-08 05:29:26,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:29:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1610 transitions. [2025-03-08 05:29:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:29:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:26,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:26,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:29:26,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1084766856, now seen corresponding path program 1 times [2025-03-08 05:29:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287037446] [2025-03-08 05:29:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:26,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:29:26,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:29:26,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:27,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287037446] [2025-03-08 05:29:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287037446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886528670] [2025-03-08 05:29:27,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:27,052 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-08 05:29:27,054 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-08 05:29:27,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:29:27,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:29:27,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:27,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:27,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:27,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:29:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886528670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:29:27,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:29:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:29:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832808505] [2025-03-08 05:29:27,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:29:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:27,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:27,356 INFO L87 Difference]: Start difference. First operand 1031 states and 1610 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:27,508 INFO L93 Difference]: Finished difference Result 2196 states and 3487 transitions. [2025-03-08 05:29:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 106 [2025-03-08 05:29:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:27,519 INFO L225 Difference]: With dead ends: 2196 [2025-03-08 05:29:27,520 INFO L226 Difference]: Without dead ends: 1894 [2025-03-08 05:29:27,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 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-08 05:29:27,522 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 511 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:27,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1154 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-03-08 05:29:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1830. [2025-03-08 05:29:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1454 states have (on average 1.6127922971114168) internal successors, (2345), 1461 states have internal predecessors, (2345), 322 states have call successors, (322), 50 states have call predecessors, (322), 53 states have return successors, (340), 318 states have call predecessors, (340), 318 states have call successors, (340) [2025-03-08 05:29:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 3007 transitions. [2025-03-08 05:29:27,600 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 3007 transitions. Word has length 106 [2025-03-08 05:29:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:27,600 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 3007 transitions. [2025-03-08 05:29:27,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 3007 transitions. [2025-03-08 05:29:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:29:27,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:27,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:27,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:29:27,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1966707159, now seen corresponding path program 1 times [2025-03-08 05:29:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375008245] [2025-03-08 05:29:27,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:27,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:29:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:29:27,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:27,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375008245] [2025-03-08 05:29:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375008245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:27,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922130916] [2025-03-08 05:29:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:27,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:27,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:27,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:27,876 INFO L87 Difference]: Start difference. First operand 1830 states and 3007 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:27,968 INFO L93 Difference]: Finished difference Result 4456 states and 7403 transitions. [2025-03-08 05:29:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-08 05:29:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:27,981 INFO L225 Difference]: With dead ends: 4456 [2025-03-08 05:29:27,982 INFO L226 Difference]: Without dead ends: 2693 [2025-03-08 05:29:27,988 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-08 05:29:27,989 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 105 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 690 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-08 05:29:27,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 690 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-03-08 05:29:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2661. [2025-03-08 05:29:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2118 states have (on average 1.6241737488196413) internal successors, (3440), 2125 states have internal predecessors, (3440), 489 states have call successors, (489), 50 states have call predecessors, (489), 53 states have return successors, (517), 485 states have call predecessors, (517), 485 states have call successors, (517) [2025-03-08 05:29:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4446 transitions. [2025-03-08 05:29:28,098 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4446 transitions. Word has length 113 [2025-03-08 05:29:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:28,098 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4446 transitions. [2025-03-08 05:29:28,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4446 transitions. [2025-03-08 05:29:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:29:28,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:28,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:29:28,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -786808124, now seen corresponding path program 1 times [2025-03-08 05:29:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257421159] [2025-03-08 05:29:28,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:28,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:29:28,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:29:28,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257421159] [2025-03-08 05:29:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257421159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609300539] [2025-03-08 05:29:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:28,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:28,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:28,189 INFO L87 Difference]: Start difference. First operand 2661 states and 4446 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:28,288 INFO L93 Difference]: Finished difference Result 6573 states and 11058 transitions. [2025-03-08 05:29:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-08 05:29:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:28,307 INFO L225 Difference]: With dead ends: 6573 [2025-03-08 05:29:28,307 INFO L226 Difference]: Without dead ends: 4028 [2025-03-08 05:29:28,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:28,317 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 103 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:28,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2025-03-08 05:29:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3996. [2025-03-08 05:29:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3996 states, 3194 states have (on average 1.6333750782717595) internal successors, (5217), 3201 states have internal predecessors, (5217), 748 states have call successors, (748), 50 states have call predecessors, (748), 53 states have return successors, (776), 744 states have call predecessors, (776), 744 states have call successors, (776) [2025-03-08 05:29:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 6741 transitions. [2025-03-08 05:29:28,504 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 6741 transitions. Word has length 114 [2025-03-08 05:29:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:28,504 INFO L471 AbstractCegarLoop]: Abstraction has 3996 states and 6741 transitions. [2025-03-08 05:29:28,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 6741 transitions. [2025-03-08 05:29:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:29:28,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:28,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:28,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:29:28,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2111823768, now seen corresponding path program 1 times [2025-03-08 05:29:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467117455] [2025-03-08 05:29:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:28,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:29:28,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:29:28,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:28,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:28,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:28,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467117455] [2025-03-08 05:29:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467117455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937316434] [2025-03-08 05:29:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:28,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:28,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:28,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:28,578 INFO L87 Difference]: Start difference. First operand 3996 states and 6741 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:28,737 INFO L93 Difference]: Finished difference Result 9949 states and 16903 transitions. [2025-03-08 05:29:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-08 05:29:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:28,767 INFO L225 Difference]: With dead ends: 9949 [2025-03-08 05:29:28,767 INFO L226 Difference]: Without dead ends: 6187 [2025-03-08 05:29:28,780 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-08 05:29:28,780 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 101 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 667 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-08 05:29:28,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 667 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2025-03-08 05:29:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 6155. [2025-03-08 05:29:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 4992 states have (on average 1.6440304487179487) internal successors, (8207), 4999 states have internal predecessors, (8207), 1109 states have call successors, (1109), 50 states have call predecessors, (1109), 53 states have return successors, (1153), 1105 states have call predecessors, (1153), 1105 states have call successors, (1153) [2025-03-08 05:29:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 10469 transitions. [2025-03-08 05:29:29,075 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 10469 transitions. Word has length 115 [2025-03-08 05:29:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:29,076 INFO L471 AbstractCegarLoop]: Abstraction has 6155 states and 10469 transitions. [2025-03-08 05:29:29,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 10469 transitions. [2025-03-08 05:29:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:29,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:29,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:29,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:29:29,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1686425443, now seen corresponding path program 1 times [2025-03-08 05:29:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611810710] [2025-03-08 05:29:29,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:29,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:29,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:29,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:29,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611810710] [2025-03-08 05:29:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611810710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:29,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775000728] [2025-03-08 05:29:29,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:29,164 INFO L87 Difference]: Start difference. First operand 6155 states and 10469 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:29,441 INFO L93 Difference]: Finished difference Result 15634 states and 26759 transitions. [2025-03-08 05:29:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-08 05:29:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:29,491 INFO L225 Difference]: With dead ends: 15634 [2025-03-08 05:29:29,491 INFO L226 Difference]: Without dead ends: 9906 [2025-03-08 05:29:29,507 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-08 05:29:29,508 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 99 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 667 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-08 05:29:29,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 667 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9906 states. [2025-03-08 05:29:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9906 to 9874. [2025-03-08 05:29:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 8150 states have (on average 1.6536196319018406) internal successors, (13477), 8157 states have internal predecessors, (13477), 1670 states have call successors, (1670), 50 states have call predecessors, (1670), 53 states have return successors, (1740), 1666 states have call predecessors, (1740), 1666 states have call successors, (1740) [2025-03-08 05:29:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 16887 transitions. [2025-03-08 05:29:29,873 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 16887 transitions. Word has length 116 [2025-03-08 05:29:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:29,873 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 16887 transitions. [2025-03-08 05:29:29,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 16887 transitions. [2025-03-08 05:29:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:29:29,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:29,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:29:29,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:29,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1478944825, now seen corresponding path program 1 times [2025-03-08 05:29:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424974986] [2025-03-08 05:29:29,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:29,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:29:29,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:29:29,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:29,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424974986] [2025-03-08 05:29:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424974986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:29,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197570709] [2025-03-08 05:29:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:29,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:29,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:29,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:29,947 INFO L87 Difference]: Start difference. First operand 9874 states and 16887 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:30,246 INFO L93 Difference]: Finished difference Result 24890 states and 42908 transitions. [2025-03-08 05:29:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-08 05:29:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:30,306 INFO L225 Difference]: With dead ends: 24890 [2025-03-08 05:29:30,306 INFO L226 Difference]: Without dead ends: 16690 [2025-03-08 05:29:30,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:30,331 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 97 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 676 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-08 05:29:30,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 676 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16690 states. [2025-03-08 05:29:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16690 to 16658. [2025-03-08 05:29:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16658 states, 13614 states have (on average 1.6552078742470986) internal successors, (22534), 13621 states have internal predecessors, (22534), 2990 states have call successors, (2990), 50 states have call predecessors, (2990), 53 states have return successors, (3104), 2986 states have call predecessors, (3104), 2986 states have call successors, (3104) [2025-03-08 05:29:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16658 states to 16658 states and 28628 transitions. [2025-03-08 05:29:31,061 INFO L78 Accepts]: Start accepts. Automaton has 16658 states and 28628 transitions. Word has length 117 [2025-03-08 05:29:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:31,062 INFO L471 AbstractCegarLoop]: Abstraction has 16658 states and 28628 transitions. [2025-03-08 05:29:31,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16658 states and 28628 transitions. [2025-03-08 05:29:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:29:31,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:31,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:31,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -341801470, now seen corresponding path program 1 times [2025-03-08 05:29:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597394072] [2025-03-08 05:29:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:31,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:29:31,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:29:31,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:31,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597394072] [2025-03-08 05:29:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597394072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696315396] [2025-03-08 05:29:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:31,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:31,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:31,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:31,158 INFO L87 Difference]: Start difference. First operand 16658 states and 28628 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:31,712 INFO L93 Difference]: Finished difference Result 44218 states and 76369 transitions. [2025-03-08 05:29:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 05:29:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:31,842 INFO L225 Difference]: With dead ends: 44218 [2025-03-08 05:29:31,842 INFO L226 Difference]: Without dead ends: 29459 [2025-03-08 05:29:31,890 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-08 05:29:31,891 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 95 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 670 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-08 05:29:31,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 670 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29459 states. [2025-03-08 05:29:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29459 to 29427. [2025-03-08 05:29:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29427 states, 24189 states have (on average 1.6529000785481003) internal successors, (39982), 24196 states have internal predecessors, (39982), 5184 states have call successors, (5184), 50 states have call predecessors, (5184), 53 states have return successors, (5376), 5180 states have call predecessors, (5376), 5180 states have call successors, (5376) [2025-03-08 05:29:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29427 states to 29427 states and 50542 transitions. [2025-03-08 05:29:32,894 INFO L78 Accepts]: Start accepts. Automaton has 29427 states and 50542 transitions. Word has length 118 [2025-03-08 05:29:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 29427 states and 50542 transitions. [2025-03-08 05:29:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29427 states and 50542 transitions. [2025-03-08 05:29:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:29:32,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:32,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:32,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:32,927 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash 769755834, now seen corresponding path program 1 times [2025-03-08 05:29:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805754162] [2025-03-08 05:29:32,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:29:32,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:29:32,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:32,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805754162] [2025-03-08 05:29:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805754162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740804619] [2025-03-08 05:29:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:32,975 INFO L87 Difference]: Start difference. First operand 29427 states and 50542 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:34,229 INFO L93 Difference]: Finished difference Result 81282 states and 139950 transitions. [2025-03-08 05:29:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 05:29:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:34,470 INFO L225 Difference]: With dead ends: 81282 [2025-03-08 05:29:34,471 INFO L226 Difference]: Without dead ends: 54497 [2025-03-08 05:29:34,561 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-08 05:29:34,561 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 93 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 690 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-08 05:29:34,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 690 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54497 states. [2025-03-08 05:29:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54497 to 54465. [2025-03-08 05:29:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54465 states, 44704 states have (on average 1.6418441302791698) internal successors, (73397), 44711 states have internal predecessors, (73397), 9707 states have call successors, (9707), 50 states have call predecessors, (9707), 53 states have return successors, (10043), 9703 states have call predecessors, (10043), 9703 states have call successors, (10043) [2025-03-08 05:29:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54465 states to 54465 states and 93147 transitions. [2025-03-08 05:29:36,301 INFO L78 Accepts]: Start accepts. Automaton has 54465 states and 93147 transitions. Word has length 119 [2025-03-08 05:29:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 54465 states and 93147 transitions. [2025-03-08 05:29:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 54465 states and 93147 transitions. [2025-03-08 05:29:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:29:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:36,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:36,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:29:36,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:36,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1918463265, now seen corresponding path program 1 times [2025-03-08 05:29:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384337084] [2025-03-08 05:29:36,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:29:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:29:36,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:36,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:29:36,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384337084] [2025-03-08 05:29:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384337084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199717736] [2025-03-08 05:29:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:36,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:36,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:36,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:36,394 INFO L87 Difference]: Start difference. First operand 54465 states and 93147 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:38,831 INFO L93 Difference]: Finished difference Result 151897 states and 260600 transitions. [2025-03-08 05:29:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:38,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-08 05:29:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:39,301 INFO L225 Difference]: With dead ends: 151897 [2025-03-08 05:29:39,302 INFO L226 Difference]: Without dead ends: 101099 [2025-03-08 05:29:39,492 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-08 05:29:39,492 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 91 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 670 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-08 05:29:39,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 670 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101099 states. [2025-03-08 05:29:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101099 to 101067. [2025-03-08 05:29:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101067 states, 83455 states have (on average 1.636522676891738) internal successors, (136576), 83462 states have internal predecessors, (136576), 17558 states have call successors, (17558), 50 states have call predecessors, (17558), 53 states have return successors, (18168), 17554 states have call predecessors, (18168), 17554 states have call successors, (18168) [2025-03-08 05:29:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101067 states to 101067 states and 172302 transitions. [2025-03-08 05:29:43,000 INFO L78 Accepts]: Start accepts. Automaton has 101067 states and 172302 transitions. Word has length 120 [2025-03-08 05:29:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:43,000 INFO L471 AbstractCegarLoop]: Abstraction has 101067 states and 172302 transitions. [2025-03-08 05:29:43,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 101067 states and 172302 transitions. [2025-03-08 05:29:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:29:43,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:43,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:43,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:43,044 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:43,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1437049934, now seen corresponding path program 2 times [2025-03-08 05:29:43,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:43,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988782192] [2025-03-08 05:29:43,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:43,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-08 05:29:43,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 121 statements. [2025-03-08 05:29:43,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:29:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988782192] [2025-03-08 05:29:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988782192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:43,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205768434] [2025-03-08 05:29:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:43,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:43,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:43,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:43,540 INFO L87 Difference]: Start difference. First operand 101067 states and 172302 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:46,913 INFO L93 Difference]: Finished difference Result 197505 states and 336923 transitions. [2025-03-08 05:29:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-08 05:29:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:47,789 INFO L225 Difference]: With dead ends: 197505 [2025-03-08 05:29:47,789 INFO L226 Difference]: Without dead ends: 197180 [2025-03-08 05:29:47,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:47,887 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 294 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:47,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197180 states. [2025-03-08 05:29:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197180 to 194783. [2025-03-08 05:29:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194783 states, 160990 states have (on average 1.6304428846512207) internal successors, (262485), 161000 states have internal predecessors, (262485), 33697 states have call successors, (33697), 92 states have call predecessors, (33697), 95 states have return successors, (34230), 33690 states have call predecessors, (34230), 33690 states have call successors, (34230) [2025-03-08 05:29:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194783 states to 194783 states and 330412 transitions. [2025-03-08 05:29:55,078 INFO L78 Accepts]: Start accepts. Automaton has 194783 states and 330412 transitions. Word has length 121 [2025-03-08 05:29:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:55,078 INFO L471 AbstractCegarLoop]: Abstraction has 194783 states and 330412 transitions. [2025-03-08 05:29:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:29:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 194783 states and 330412 transitions. [2025-03-08 05:29:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:29:55,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:55,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:55,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:29:55,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:55,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -795070644, now seen corresponding path program 1 times [2025-03-08 05:29:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344533066] [2025-03-08 05:29:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:29:55,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:29:55,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:55,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:29:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344533066] [2025-03-08 05:29:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344533066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219941028] [2025-03-08 05:29:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:55,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:55,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:55,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:55,247 INFO L87 Difference]: Start difference. First operand 194783 states and 330412 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)