./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product18.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 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:00,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:00,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:23:00,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:00,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:00,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:00,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:00,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:00,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:00,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:00,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:00,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:00,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:00,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:00,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:00,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:00,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:00,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:00,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:00,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:00,961 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 -> 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 [2025-03-03 14:23:01,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:01,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:01,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:01,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:01,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:01,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2025-03-03 14:23:02,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647df0efb/af612082cbe040a6b9ede3366b6ce4c7/FLAG17a892598 [2025-03-03 14:23:02,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:02,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2025-03-03 14:23:02,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647df0efb/af612082cbe040a6b9ede3366b6ce4c7/FLAG17a892598 [2025-03-03 14:23:02,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647df0efb/af612082cbe040a6b9ede3366b6ce4c7 [2025-03-03 14:23:02,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:02,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:02,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:02,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:02,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:02,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:02" (1/1) ... [2025-03-03 14:23:02,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c14eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:02, skipping insertion in model container [2025-03-03 14:23:02,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:02" (1/1) ... [2025-03-03 14:23:02,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:03,147 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_spec3_product18.cil.c[42127,42140] [2025-03-03 14:23:03,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:03,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:03,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-03 14:23:03,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [97] [2025-03-03 14:23:03,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1177] [2025-03-03 14:23:03,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1470] [2025-03-03 14:23:03,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1836] [2025-03-03 14:23:03,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1845] [2025-03-03 14:23:03,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2147] [2025-03-03 14:23:03,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2550] [2025-03-03 14:23:03,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-03-03 14:23:03,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2824] [2025-03-03 14:23:03,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2921] [2025-03-03 14:23:03,319 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_spec3_product18.cil.c[42127,42140] [2025-03-03 14:23:03,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:03,363 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:03,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03 WrapperNode [2025-03-03 14:23:03,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:03,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:03,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:03,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:03,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,417 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 57, calls inlined = 48, statements flattened = 879 [2025-03-03 14:23:03,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:03,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:03,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:03,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:03,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,458 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:23:03,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:03,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:03,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:03,487 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:03,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (1/1) ... [2025-03-03 14:23:03,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:03,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:23:03,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:23:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:03,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:03,550 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:03,552 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:03,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:03,697 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:03,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:03,895 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L672-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~10#1; [2025-03-03 14:23:03,895 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154-1: getClientId_#res#1 := getClientId_~retValue_acc~18#1; [2025-03-03 14:23:03,895 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~11#1; [2025-03-03 14:23:03,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2457: #res := ~retValue_acc~36; [2025-03-03 14:23:03,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2044: #res := ~retValue_acc~27; [2025-03-03 14:23:03,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L766-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~12#1; [2025-03-03 14:23:03,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L811: #res#1 := ~retValue_acc~13#1; [2025-03-03 14:23:03,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1035: #res := ~retValue_acc~16; [2025-03-03 14:23:03,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2918-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-03-03 14:23:04,001 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2494: #res := ~retValue_acc~37; [2025-03-03 14:23:04,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2268: #res := ~retValue_acc~31; [2025-03-03 14:23:04,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2001-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~24#1; [2025-03-03 14:23:04,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:23:04,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~25#1; [2025-03-03 14:23:04,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2019-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~26#1; [2025-03-03 14:23:04,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~15#1; [2025-03-03 14:23:04,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L874-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~14#1; [2025-03-03 14:23:04,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231: #res := ~retValue_acc~30; [2025-03-03 14:23:04,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: #res := ~retValue_acc~39; [2025-03-03 14:23:04,338 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-03-03 14:23:04,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:23:04,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:23:04,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:23:04,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:04 BoogieIcfgContainer [2025-03-03 14:23:04,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:23:04,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:23:04,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:23:04,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:23:04,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:02" (1/3) ... [2025-03-03 14:23:04,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36790c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:04, skipping insertion in model container [2025-03-03 14:23:04,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:03" (2/3) ... [2025-03-03 14:23:04,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36790c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:04, skipping insertion in model container [2025-03-03 14:23:04,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:04" (3/3) ... [2025-03-03 14:23:04,358 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product18.cil.c [2025-03-03 14:23:04,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:23:04,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product18.cil.c that has 20 procedures, 305 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:23:04,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:23:04,433 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;@4a8f052a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:23:04,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:23:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 242 states have internal predecessors, (364), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:23:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:23:04,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:04,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:04,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -67036958, now seen corresponding path program 1 times [2025-03-03 14:23:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805218852] [2025-03-03 14:23:04,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:23:04,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:23:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:04,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:23:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805218852] [2025-03-03 14:23:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805218852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686371346] [2025-03-03 14:23:05,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:05,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:05,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:05,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:23:05,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:23:05,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:23:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:05,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:23:05,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:23:05,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:05,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686371346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:05,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:05,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:23:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091293385] [2025-03-03 14:23:05,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:05,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:23:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:05,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:23:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:05,389 INFO L87 Difference]: Start difference. First operand has 305 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 242 states have internal predecessors, (364), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:05,432 INFO L93 Difference]: Finished difference Result 456 states and 668 transitions. [2025-03-03 14:23:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:23:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-03-03 14:23:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:05,442 INFO L225 Difference]: With dead ends: 456 [2025-03-03 14:23:05,445 INFO L226 Difference]: Without dead ends: 297 [2025-03-03 14:23:05,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:05,454 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:05,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-03 14:23:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-03 14:23:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.5258620689655173) internal successors, (354), 234 states have internal predecessors, (354), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:23:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 443 transitions. [2025-03-03 14:23:05,498 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 443 transitions. Word has length 103 [2025-03-03 14:23:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:05,502 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 443 transitions. [2025-03-03 14:23:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2025-03-03 14:23:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:23:05,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:05,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:05,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:23:05,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:23:05,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:05,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 734201830, now seen corresponding path program 1 times [2025-03-03 14:23:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606782427] [2025-03-03 14:23:05,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:05,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:23:05,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:23:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:23:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606782427] [2025-03-03 14:23:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606782427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534278279] [2025-03-03 14:23:05,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:05,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:23:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:23:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:23:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:06,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:23:06,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:23:06,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534278279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:06,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716305466] [2025-03-03 14:23:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:06,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:06,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:06,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:06,251 INFO L87 Difference]: Start difference. First operand 297 states and 443 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:06,277 INFO L93 Difference]: Finished difference Result 444 states and 645 transitions. [2025-03-03 14:23:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-03-03 14:23:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:06,280 INFO L225 Difference]: With dead ends: 444 [2025-03-03 14:23:06,280 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 14:23:06,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:06,282 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:06,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 14:23:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-03 14:23:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 234 states have (on average 1.5213675213675213) internal successors, (356), 236 states have internal predecessors, (356), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:23:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 445 transitions. [2025-03-03 14:23:06,308 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 445 transitions. Word has length 104 [2025-03-03 14:23:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:06,310 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 445 transitions. [2025-03-03 14:23:06,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 445 transitions. [2025-03-03 14:23:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:23:06,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:06,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:06,322 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-03 14:23:06,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:23:06,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:06,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -572689928, now seen corresponding path program 1 times [2025-03-03 14:23:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12671759] [2025-03-03 14:23:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:06,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:23:06,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:23:06,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12671759] [2025-03-03 14:23:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12671759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72645455] [2025-03-03 14:23:06,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:06,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:06,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:06,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:23:06,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:23:06,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:23:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:06,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:23:07,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72645455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329761058] [2025-03-03 14:23:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:07,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:07,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:07,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:07,027 INFO L87 Difference]: Start difference. First operand 299 states and 445 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:07,058 INFO L93 Difference]: Finished difference Result 627 states and 948 transitions. [2025-03-03 14:23:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:07,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-03 14:23:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:07,087 INFO L225 Difference]: With dead ends: 627 [2025-03-03 14:23:07,087 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 14:23:07,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:07,089 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 107 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:07,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 840 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 14:23:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 347. [2025-03-03 14:23:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 273 states have internal predecessors, (417), 57 states have call successors, (57), 19 states have call predecessors, (57), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 14:23:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 528 transitions. [2025-03-03 14:23:07,113 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 528 transitions. Word has length 112 [2025-03-03 14:23:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 528 transitions. [2025-03-03 14:23:07,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 528 transitions. [2025-03-03 14:23:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:23:07,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:07,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:07,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:07,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:07,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:07,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1503136250, now seen corresponding path program 1 times [2025-03-03 14:23:07,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:07,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014990364] [2025-03-03 14:23:07,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:07,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:23:07,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:23:07,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:07,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014990364] [2025-03-03 14:23:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014990364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:07,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106718841] [2025-03-03 14:23:07,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:07,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:07,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:23:07,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:23:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:23:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:23:07,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:23:07,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106718841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:23:07,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121032602] [2025-03-03 14:23:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:07,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:07,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:07,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:07,769 INFO L87 Difference]: Start difference. First operand 347 states and 528 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:07,832 INFO L93 Difference]: Finished difference Result 685 states and 1046 transitions. [2025-03-03 14:23:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:07,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-03 14:23:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:07,837 INFO L225 Difference]: With dead ends: 685 [2025-03-03 14:23:07,838 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 14:23:07,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:07,840 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:07,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1729 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 14:23:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-03 14:23:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 272 states have (on average 1.536764705882353) internal successors, (418), 275 states have internal predecessors, (418), 57 states have call successors, (57), 19 states have call predecessors, (57), 19 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2025-03-03 14:23:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2025-03-03 14:23:07,857 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 113 [2025-03-03 14:23:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:07,857 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2025-03-03 14:23:07,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2025-03-03 14:23:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:23:07,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:07,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:07,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:08,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:08,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:08,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -225516841, now seen corresponding path program 1 times [2025-03-03 14:23:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565520829] [2025-03-03 14:23:08,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:08,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:23:08,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:23:08,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:23:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565520829] [2025-03-03 14:23:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565520829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:08,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954899919] [2025-03-03 14:23:08,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:08,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:08,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:08,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:23:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:23:08,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:23:08,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:23:08,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:23:08,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954899919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:08,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:08,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:23:08,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592966706] [2025-03-03 14:23:08,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:08,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:08,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:08,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:08,463 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:08,512 INFO L93 Difference]: Finished difference Result 687 states and 1051 transitions. [2025-03-03 14:23:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:08,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:23:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:08,514 INFO L225 Difference]: With dead ends: 687 [2025-03-03 14:23:08,514 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:23:08,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:08,516 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:08,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:23:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 14:23:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.534798534798535) internal successors, (419), 277 states have internal predecessors, (419), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2025-03-03 14:23:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 537 transitions. [2025-03-03 14:23:08,527 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 537 transitions. Word has length 114 [2025-03-03 14:23:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:08,527 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 537 transitions. [2025-03-03 14:23:08,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 537 transitions. [2025-03-03 14:23:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:23:08,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:08,530 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:08,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:23:08,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:08,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1550399159, now seen corresponding path program 1 times [2025-03-03 14:23:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128093146] [2025-03-03 14:23:08,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:08,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:23:08,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:23:08,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128093146] [2025-03-03 14:23:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128093146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675602224] [2025-03-03 14:23:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:08,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:08,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:08,849 INFO L87 Difference]: Start difference. First operand 351 states and 537 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:08,887 INFO L93 Difference]: Finished difference Result 679 states and 1042 transitions. [2025-03-03 14:23:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-03-03 14:23:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:08,889 INFO L225 Difference]: With dead ends: 679 [2025-03-03 14:23:08,889 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:23:08,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:08,891 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:08,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1733 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:23:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 14:23:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.534798534798535) internal successors, (419), 277 states have internal predecessors, (419), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2025-03-03 14:23:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 536 transitions. [2025-03-03 14:23:08,902 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 536 transitions. Word has length 115 [2025-03-03 14:23:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 536 transitions. [2025-03-03 14:23:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 536 transitions. [2025-03-03 14:23:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:23:08,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:08,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:08,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:23:08,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1072011830, now seen corresponding path program 2 times [2025-03-03 14:23:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404509632] [2025-03-03 14:23:08,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:23:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:08,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-03 14:23:08,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:23:08,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:23:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:23:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404509632] [2025-03-03 14:23:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404509632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958579869] [2025-03-03 14:23:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:09,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:09,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:09,029 INFO L87 Difference]: Start difference. First operand 351 states and 536 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:09,066 INFO L93 Difference]: Finished difference Result 677 states and 1037 transitions. [2025-03-03 14:23:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-03 14:23:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:09,069 INFO L225 Difference]: With dead ends: 677 [2025-03-03 14:23:09,069 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:23:09,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:09,070 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:09,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1719 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:23:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 14:23:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.534798534798535) internal successors, (419), 277 states have internal predecessors, (419), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-03 14:23:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 535 transitions. [2025-03-03 14:23:09,081 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 535 transitions. Word has length 116 [2025-03-03 14:23:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:09,081 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 535 transitions. [2025-03-03 14:23:09,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 535 transitions. [2025-03-03 14:23:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:23:09,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:09,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:09,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:23:09,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -106169224, now seen corresponding path program 3 times [2025-03-03 14:23:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284350709] [2025-03-03 14:23:09,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:23:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 117 statements into 3 equivalence classes. [2025-03-03 14:23:09,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 105 of 117 statements. [2025-03-03 14:23:09,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:23:09,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:23:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284350709] [2025-03-03 14:23:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284350709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:23:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798406] [2025-03-03 14:23:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:23:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:09,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:23:09,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:09,255 INFO L87 Difference]: Start difference. First operand 351 states and 535 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:09,670 INFO L93 Difference]: Finished difference Result 872 states and 1255 transitions. [2025-03-03 14:23:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:23:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-03 14:23:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:09,677 INFO L225 Difference]: With dead ends: 872 [2025-03-03 14:23:09,677 INFO L226 Difference]: Without dead ends: 734 [2025-03-03 14:23:09,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:23:09,678 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1300 mSDsluCounter, 2832 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:09,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 3516 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-03 14:23:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 724. [2025-03-03 14:23:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 573 states have (on average 1.486910994764398) internal successors, (852), 580 states have internal predecessors, (852), 96 states have call successors, (96), 48 states have call predecessors, (96), 54 states have return successors, (104), 95 states have call predecessors, (104), 90 states have call successors, (104) [2025-03-03 14:23:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1052 transitions. [2025-03-03 14:23:09,732 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1052 transitions. Word has length 117 [2025-03-03 14:23:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:09,733 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1052 transitions. [2025-03-03 14:23:09,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1052 transitions. [2025-03-03 14:23:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:23:09,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:09,734 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-03 14:23:09,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:23:09,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash 55423323, now seen corresponding path program 1 times [2025-03-03 14:23:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342692468] [2025-03-03 14:23:09,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:23:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:23:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:23:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342692468] [2025-03-03 14:23:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342692468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210254996] [2025-03-03 14:23:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:09,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:09,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:09,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:09,862 INFO L87 Difference]: Start difference. First operand 724 states and 1052 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:09,912 INFO L93 Difference]: Finished difference Result 1427 states and 2077 transitions. [2025-03-03 14:23:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2025-03-03 14:23:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:09,917 INFO L225 Difference]: With dead ends: 1427 [2025-03-03 14:23:09,918 INFO L226 Difference]: Without dead ends: 726 [2025-03-03 14:23:09,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:09,922 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:09,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1736 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-03 14:23:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2025-03-03 14:23:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 574 states have (on average 1.4860627177700347) internal successors, (853), 582 states have internal predecessors, (853), 96 states have call successors, (96), 48 states have call predecessors, (96), 55 states have return successors, (106), 95 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-03 14:23:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1055 transitions. [2025-03-03 14:23:09,955 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1055 transitions. Word has length 118 [2025-03-03 14:23:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1055 transitions. [2025-03-03 14:23:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1055 transitions. [2025-03-03 14:23:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:23:09,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:09,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:23:09,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -485931393, now seen corresponding path program 1 times [2025-03-03 14:23:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156713727] [2025-03-03 14:23:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:23:09,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:23:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:23:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156713727] [2025-03-03 14:23:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156713727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:10,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402955008] [2025-03-03 14:23:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:10,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:10,078 INFO L87 Difference]: Start difference. First operand 726 states and 1055 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:23:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:10,209 INFO L93 Difference]: Finished difference Result 1432 states and 2086 transitions. [2025-03-03 14:23:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:23:10,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2025-03-03 14:23:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:10,214 INFO L225 Difference]: With dead ends: 1432 [2025-03-03 14:23:10,214 INFO L226 Difference]: Without dead ends: 731 [2025-03-03 14:23:10,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:23:10,217 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 5 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:10,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2974 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-03 14:23:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2025-03-03 14:23:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 578 states have (on average 1.4844290657439447) internal successors, (858), 586 states have internal predecessors, (858), 96 states have call successors, (96), 49 states have call predecessors, (96), 56 states have return successors, (111), 95 states have call predecessors, (111), 90 states have call successors, (111) [2025-03-03 14:23:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2025-03-03 14:23:10,243 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 119 [2025-03-03 14:23:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:10,243 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2025-03-03 14:23:10,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:23:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2025-03-03 14:23:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:23:10,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:10,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:23:10,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1120548138, now seen corresponding path program 1 times [2025-03-03 14:23:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606893334] [2025-03-03 14:23:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:10,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:23:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:23:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:23:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606893334] [2025-03-03 14:23:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606893334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488751841] [2025-03-03 14:23:10,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:10,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:10,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:10,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:23:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:23:10,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:23:10,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:10,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:10,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:10,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488751841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:10,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:23:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836694999] [2025-03-03 14:23:10,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:23:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:23:10,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:10,717 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:23:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,168 INFO L93 Difference]: Finished difference Result 1833 states and 2754 transitions. [2025-03-03 14:23:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:23:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 120 [2025-03-03 14:23:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,174 INFO L225 Difference]: With dead ends: 1833 [2025-03-03 14:23:11,174 INFO L226 Difference]: Without dead ends: 1134 [2025-03-03 14:23:11,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:23:11,179 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 1086 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:11,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 3100 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-03 14:23:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1056. [2025-03-03 14:23:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 839 states have (on average 1.532777115613826) internal successors, (1286), 846 states have internal predecessors, (1286), 160 states have call successors, (160), 50 states have call predecessors, (160), 56 states have return successors, (185), 159 states have call predecessors, (185), 154 states have call successors, (185) [2025-03-03 14:23:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1631 transitions. [2025-03-03 14:23:11,224 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1631 transitions. Word has length 120 [2025-03-03 14:23:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,225 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1631 transitions. [2025-03-03 14:23:11,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:23:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1631 transitions. [2025-03-03 14:23:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:23:11,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:11,429 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash -676987701, now seen corresponding path program 1 times [2025-03-03 14:23:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916816196] [2025-03-03 14:23:11,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:23:11,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:23:11,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916816196] [2025-03-03 14:23:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916816196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51656715] [2025-03-03 14:23:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:11,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:11,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:11,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:11,497 INFO L87 Difference]: Start difference. First operand 1056 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,544 INFO L93 Difference]: Finished difference Result 2352 states and 3692 transitions. [2025-03-03 14:23:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:23:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,552 INFO L225 Difference]: With dead ends: 2352 [2025-03-03 14:23:11,553 INFO L226 Difference]: Without dead ends: 1377 [2025-03-03 14:23:11,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:11,557 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 104 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:11,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 883 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-03 14:23:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1351. [2025-03-03 14:23:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1070 states have (on average 1.5570093457943925) internal successors, (1666), 1077 states have internal predecessors, (1666), 224 states have call successors, (224), 50 states have call predecessors, (224), 56 states have return successors, (259), 223 states have call predecessors, (259), 218 states have call successors, (259) [2025-03-03 14:23:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2149 transitions. [2025-03-03 14:23:11,616 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2149 transitions. Word has length 123 [2025-03-03 14:23:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,616 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2149 transitions. [2025-03-03 14:23:11,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2149 transitions. [2025-03-03 14:23:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:23:11,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:23:11,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1353540252, now seen corresponding path program 1 times [2025-03-03 14:23:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706981459] [2025-03-03 14:23:11,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:23:11,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:23:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706981459] [2025-03-03 14:23:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706981459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:11,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232806471] [2025-03-03 14:23:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:11,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:11,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:11,678 INFO L87 Difference]: Start difference. First operand 1351 states and 2149 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,746 INFO L93 Difference]: Finished difference Result 3081 states and 4945 transitions. [2025-03-03 14:23:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:23:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,757 INFO L225 Difference]: With dead ends: 3081 [2025-03-03 14:23:11,757 INFO L226 Difference]: Without dead ends: 1862 [2025-03-03 14:23:11,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:11,763 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 102 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:11,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 880 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-03-03 14:23:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1836. [2025-03-03 14:23:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1460 states have (on average 1.5753424657534247) internal successors, (2300), 1467 states have internal predecessors, (2300), 319 states have call successors, (319), 50 states have call predecessors, (319), 56 states have return successors, (354), 318 states have call predecessors, (354), 313 states have call successors, (354) [2025-03-03 14:23:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2973 transitions. [2025-03-03 14:23:11,867 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2973 transitions. Word has length 124 [2025-03-03 14:23:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,867 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2973 transitions. [2025-03-03 14:23:11,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2973 transitions. [2025-03-03 14:23:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:23:11,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:23:11,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash 852627306, now seen corresponding path program 1 times [2025-03-03 14:23:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135472545] [2025-03-03 14:23:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:23:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:23:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135472545] [2025-03-03 14:23:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135472545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345287455] [2025-03-03 14:23:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:11,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:11,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:11,927 INFO L87 Difference]: Start difference. First operand 1836 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,996 INFO L93 Difference]: Finished difference Result 4165 states and 6811 transitions. [2025-03-03 14:23:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:23:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,010 INFO L225 Difference]: With dead ends: 4165 [2025-03-03 14:23:12,011 INFO L226 Difference]: Without dead ends: 2593 [2025-03-03 14:23:12,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,018 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 100 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:12,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 873 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2025-03-03 14:23:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2567. [2025-03-03 14:23:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2068 states have (on average 1.5909090909090908) internal successors, (3290), 2075 states have internal predecessors, (3290), 442 states have call successors, (442), 50 states have call predecessors, (442), 56 states have return successors, (493), 441 states have call predecessors, (493), 436 states have call successors, (493) [2025-03-03 14:23:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 4225 transitions. [2025-03-03 14:23:12,135 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 4225 transitions. Word has length 125 [2025-03-03 14:23:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:12,135 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 4225 transitions. [2025-03-03 14:23:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 4225 transitions. [2025-03-03 14:23:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:23:12,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:12,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:12,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:23:12,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:12,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1230572443, now seen corresponding path program 1 times [2025-03-03 14:23:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:12,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239635333] [2025-03-03 14:23:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:12,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:23:12,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:23:12,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:12,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239635333] [2025-03-03 14:23:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239635333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023552338] [2025-03-03 14:23:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:12,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:12,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,229 INFO L87 Difference]: Start difference. First operand 2567 states and 4225 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,313 INFO L93 Difference]: Finished difference Result 5843 states and 9703 transitions. [2025-03-03 14:23:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-03 14:23:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,332 INFO L225 Difference]: With dead ends: 5843 [2025-03-03 14:23:12,332 INFO L226 Difference]: Without dead ends: 3755 [2025-03-03 14:23:12,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,342 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 98 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:12,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 873 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2025-03-03 14:23:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3729. [2025-03-03 14:23:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3729 states, 3051 states have (on average 1.6027531956735497) internal successors, (4890), 3058 states have internal predecessors, (4890), 621 states have call successors, (621), 50 states have call predecessors, (621), 56 states have return successors, (698), 620 states have call predecessors, (698), 615 states have call successors, (698) [2025-03-03 14:23:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3729 states and 6209 transitions. [2025-03-03 14:23:12,504 INFO L78 Accepts]: Start accepts. Automaton has 3729 states and 6209 transitions. Word has length 126 [2025-03-03 14:23:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 3729 states and 6209 transitions. [2025-03-03 14:23:12,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3729 states and 6209 transitions. [2025-03-03 14:23:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:23:12,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:12,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:23:12,516 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1921741609, now seen corresponding path program 1 times [2025-03-03 14:23:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349393769] [2025-03-03 14:23:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:12,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:12,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:23:12,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:23:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:12,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349393769] [2025-03-03 14:23:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349393769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:12,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222381503] [2025-03-03 14:23:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:12,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:12,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:12,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,570 INFO L87 Difference]: Start difference. First operand 3729 states and 6209 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,754 INFO L93 Difference]: Finished difference Result 8860 states and 14863 transitions. [2025-03-03 14:23:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:23:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,782 INFO L225 Difference]: With dead ends: 8860 [2025-03-03 14:23:12,783 INFO L226 Difference]: Without dead ends: 5857 [2025-03-03 14:23:12,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,795 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 96 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:12,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 884 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5857 states. [2025-03-03 14:23:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5857 to 5831. [2025-03-03 14:23:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5831 states, 4777 states have (on average 1.602888842369688) internal successors, (7657), 4784 states have internal predecessors, (7657), 997 states have call successors, (997), 50 states have call predecessors, (997), 56 states have return successors, (1118), 996 states have call predecessors, (1118), 991 states have call successors, (1118) [2025-03-03 14:23:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 9772 transitions. [2025-03-03 14:23:13,047 INFO L78 Accepts]: Start accepts. Automaton has 5831 states and 9772 transitions. Word has length 127 [2025-03-03 14:23:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:13,047 INFO L471 AbstractCegarLoop]: Abstraction has 5831 states and 9772 transitions. [2025-03-03 14:23:13,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5831 states and 9772 transitions. [2025-03-03 14:23:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:23:13,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:13,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:13,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1694198438, now seen corresponding path program 1 times [2025-03-03 14:23:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885623927] [2025-03-03 14:23:13,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:23:13,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:23:13,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885623927] [2025-03-03 14:23:13,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885623927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682714058] [2025-03-03 14:23:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,108 INFO L87 Difference]: Start difference. First operand 5831 states and 9772 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:13,334 INFO L93 Difference]: Finished difference Result 14177 states and 23948 transitions. [2025-03-03 14:23:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:23:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:13,384 INFO L225 Difference]: With dead ends: 14177 [2025-03-03 14:23:13,384 INFO L226 Difference]: Without dead ends: 9468 [2025-03-03 14:23:13,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,402 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 94 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:13,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9468 states. [2025-03-03 14:23:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9468 to 9442. [2025-03-03 14:23:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9442 states, 7782 states have (on average 1.6052428681572861) internal successors, (12492), 7789 states have internal predecessors, (12492), 1603 states have call successors, (1603), 50 states have call predecessors, (1603), 56 states have return successors, (1802), 1602 states have call predecessors, (1802), 1597 states have call successors, (1802) [2025-03-03 14:23:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 15897 transitions. [2025-03-03 14:23:13,785 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 15897 transitions. Word has length 128 [2025-03-03 14:23:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:13,785 INFO L471 AbstractCegarLoop]: Abstraction has 9442 states and 15897 transitions. [2025-03-03 14:23:13,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 15897 transitions. [2025-03-03 14:23:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:23:13,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:13,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:13,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1198688632, now seen corresponding path program 1 times [2025-03-03 14:23:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602095575] [2025-03-03 14:23:13,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:23:13,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:23:13,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602095575] [2025-03-03 14:23:13,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602095575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808891803] [2025-03-03 14:23:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,859 INFO L87 Difference]: Start difference. First operand 9442 states and 15897 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:14,354 INFO L93 Difference]: Finished difference Result 24159 states and 40906 transitions. [2025-03-03 14:23:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:14,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:23:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:14,423 INFO L225 Difference]: With dead ends: 24159 [2025-03-03 14:23:14,423 INFO L226 Difference]: Without dead ends: 16284 [2025-03-03 14:23:14,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:14,457 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 92 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:14,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 884 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16284 states. [2025-03-03 14:23:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16284 to 16258. [2025-03-03 14:23:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16258 states, 13395 states have (on average 1.599477416946622) internal successors, (21425), 13402 states have internal predecessors, (21425), 2806 states have call successors, (2806), 50 states have call predecessors, (2806), 56 states have return successors, (3149), 2805 states have call predecessors, (3149), 2800 states have call successors, (3149) [2025-03-03 14:23:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 27380 transitions. [2025-03-03 14:23:15,146 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 27380 transitions. Word has length 129 [2025-03-03 14:23:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:15,146 INFO L471 AbstractCegarLoop]: Abstraction has 16258 states and 27380 transitions. [2025-03-03 14:23:15,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 27380 transitions. [2025-03-03 14:23:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:23:15,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:15,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:15,176 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 199444903, now seen corresponding path program 1 times [2025-03-03 14:23:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831309240] [2025-03-03 14:23:15,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:15,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:23:15,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:23:15,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:15,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831309240] [2025-03-03 14:23:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831309240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146333001] [2025-03-03 14:23:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:15,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:15,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:15,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:15,225 INFO L87 Difference]: Start difference. First operand 16258 states and 27380 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:15,827 INFO L93 Difference]: Finished difference Result 42730 states and 72368 transitions. [2025-03-03 14:23:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-03-03 14:23:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:15,930 INFO L225 Difference]: With dead ends: 42730 [2025-03-03 14:23:15,930 INFO L226 Difference]: Without dead ends: 28673 [2025-03-03 14:23:15,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:15,957 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 90 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:15,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2025-03-03 14:23:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 28647. [2025-03-03 14:23:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28647 states, 23745 states have (on average 1.597220467466835) internal successors, (37926), 23752 states have internal predecessors, (37926), 4845 states have call successors, (4845), 50 states have call predecessors, (4845), 56 states have return successors, (5462), 4844 states have call predecessors, (5462), 4839 states have call successors, (5462) [2025-03-03 14:23:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28647 states to 28647 states and 48233 transitions. [2025-03-03 14:23:17,195 INFO L78 Accepts]: Start accepts. Automaton has 28647 states and 48233 transitions. Word has length 130 [2025-03-03 14:23:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:17,196 INFO L471 AbstractCegarLoop]: Abstraction has 28647 states and 48233 transitions. [2025-03-03 14:23:17,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 28647 states and 48233 transitions. [2025-03-03 14:23:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:23:17,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:17,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:17,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:17,228 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1043666681, now seen corresponding path program 1 times [2025-03-03 14:23:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:17,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515435806] [2025-03-03 14:23:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:17,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:17,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:17,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:17,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515435806] [2025-03-03 14:23:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515435806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598105869] [2025-03-03 14:23:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:17,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:17,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:17,291 INFO L87 Difference]: Start difference. First operand 28647 states and 48233 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:18,535 INFO L93 Difference]: Finished difference Result 77712 states and 131420 transitions. [2025-03-03 14:23:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:18,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-03-03 14:23:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:18,746 INFO L225 Difference]: With dead ends: 77712 [2025-03-03 14:23:18,747 INFO L226 Difference]: Without dead ends: 52029 [2025-03-03 14:23:18,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:18,825 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 88 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2025-03-03 14:23:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 52003. [2025-03-03 14:23:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52003 states, 43386 states have (on average 1.5928179597105057) internal successors, (69106), 43393 states have internal predecessors, (69106), 8560 states have call successors, (8560), 50 states have call predecessors, (8560), 56 states have return successors, (9709), 8559 states have call predecessors, (9709), 8554 states have call successors, (9709) [2025-03-03 14:23:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52003 states to 52003 states and 87375 transitions. [2025-03-03 14:23:20,640 INFO L78 Accepts]: Start accepts. Automaton has 52003 states and 87375 transitions. Word has length 131 [2025-03-03 14:23:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 52003 states and 87375 transitions. [2025-03-03 14:23:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 52003 states and 87375 transitions. [2025-03-03 14:23:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:23:20,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:20,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:20,678 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -11256504, now seen corresponding path program 1 times [2025-03-03 14:23:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379729228] [2025-03-03 14:23:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:20,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:23:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:23:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379729228] [2025-03-03 14:23:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379729228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12066049] [2025-03-03 14:23:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:20,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:20,737 INFO L87 Difference]: Start difference. First operand 52003 states and 87375 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:23,526 INFO L93 Difference]: Finished difference Result 96973 states and 163271 transitions. [2025-03-03 14:23:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-03-03 14:23:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:23,906 INFO L225 Difference]: With dead ends: 96973 [2025-03-03 14:23:23,907 INFO L226 Difference]: Without dead ends: 96455 [2025-03-03 14:23:23,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:23,975 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 83 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:23,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 890 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96455 states. [2025-03-03 14:23:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96455 to 96429. [2025-03-03 14:23:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96429 states, 81013 states have (on average 1.5864120573241332) internal successors, (128520), 81020 states have internal predecessors, (128520), 15359 states have call successors, (15359), 50 states have call predecessors, (15359), 56 states have return successors, (17554), 15358 states have call predecessors, (17554), 15353 states have call successors, (17554) [2025-03-03 14:23:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96429 states to 96429 states and 161433 transitions. [2025-03-03 14:23:27,198 INFO L78 Accepts]: Start accepts. Automaton has 96429 states and 161433 transitions. Word has length 132 [2025-03-03 14:23:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:27,198 INFO L471 AbstractCegarLoop]: Abstraction has 96429 states and 161433 transitions. [2025-03-03 14:23:27,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 96429 states and 161433 transitions. [2025-03-03 14:23:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:23:27,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:27,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:27,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:23:27,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:27,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:27,241 INFO L85 PathProgramCache]: Analyzing trace with hash -514505914, now seen corresponding path program 1 times [2025-03-03 14:23:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36747129] [2025-03-03 14:23:27,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:27,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:23:27,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:23:27,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36747129] [2025-03-03 14:23:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36747129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:23:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019168506] [2025-03-03 14:23:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:27,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:23:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:27,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:23:27,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:27,482 INFO L87 Difference]: Start difference. First operand 96429 states and 161433 transitions. Second operand has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:29,937 INFO L93 Difference]: Finished difference Result 97088 states and 162363 transitions. [2025-03-03 14:23:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:23:29,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2025-03-03 14:23:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:30,370 INFO L225 Difference]: With dead ends: 97088 [2025-03-03 14:23:30,371 INFO L226 Difference]: Without dead ends: 96396 [2025-03-03 14:23:30,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:23:30,429 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 108 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:30,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 4315 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96396 states. [2025-03-03 14:23:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96396 to 96390. [2025-03-03 14:23:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96390 states, 80981 states have (on average 1.5864955977328015) internal successors, (128476), 80989 states have internal predecessors, (128476), 15357 states have call successors, (15357), 46 states have call predecessors, (15357), 51 states have return successors, (17552), 15354 states have call predecessors, (17552), 15352 states have call successors, (17552) [2025-03-03 14:23:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96390 states to 96390 states and 161385 transitions. [2025-03-03 14:23:33,350 INFO L78 Accepts]: Start accepts. Automaton has 96390 states and 161385 transitions. Word has length 133 [2025-03-03 14:23:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:33,351 INFO L471 AbstractCegarLoop]: Abstraction has 96390 states and 161385 transitions. [2025-03-03 14:23:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 96390 states and 161385 transitions. [2025-03-03 14:23:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:23:33,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:33,395 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:23:33,396 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 686901039, now seen corresponding path program 1 times [2025-03-03 14:23:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406745546] [2025-03-03 14:23:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:33,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:23:33,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:23:33,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:23:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406745546] [2025-03-03 14:23:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406745546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931557798] [2025-03-03 14:23:33,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:33,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:33,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:33,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:23:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:23:34,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:23:34,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:23:34,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:23:34,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931557798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-03-03 14:23:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996042826] [2025-03-03 14:23:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:34,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:23:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:34,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:23:34,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:23:34,473 INFO L87 Difference]: Start difference. First operand 96390 states and 161385 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:36,852 INFO L93 Difference]: Finished difference Result 97122 states and 162395 transitions. [2025-03-03 14:23:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:23:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 136 [2025-03-03 14:23:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:37,126 INFO L225 Difference]: With dead ends: 97122 [2025-03-03 14:23:37,126 INFO L226 Difference]: Without dead ends: 96961 [2025-03-03 14:23:37,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:23:37,162 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 696 mSDsluCounter, 4403 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:37,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4860 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96961 states.