./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_productSimulator.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_productSimulator.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 18d9c4eb49bcfbad00b16e4c52915ece2e20abb9b599480aaed1e3c1557875b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:43,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:43,616 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:43,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:43,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:43,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:43,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:43,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:43,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:43,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:43,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:43,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:43,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:43,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:43,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:43,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:43,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:43,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:43,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:43,649 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 -> 18d9c4eb49bcfbad00b16e4c52915ece2e20abb9b599480aaed1e3c1557875b0 [2025-03-03 14:23:43,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:43,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:43,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:43,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:43,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:43,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c [2025-03-03 14:23:45,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f93a24a/d08657371f9449d893d9f7a09b8ccd72/FLAG16c017201 [2025-03-03 14:23:45,425 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:45,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_productSimulator.cil.c [2025-03-03 14:23:45,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f93a24a/d08657371f9449d893d9f7a09b8ccd72/FLAG16c017201 [2025-03-03 14:23:45,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f93a24a/d08657371f9449d893d9f7a09b8ccd72 [2025-03-03 14:23:45,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:45,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:45,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:45,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:45,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:45,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:45" (1/1) ... [2025-03-03 14:23:45,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2c5588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:45, skipping insertion in model container [2025-03-03 14:23:45,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:45" (1/1) ... [2025-03-03 14:23:45,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:45,880 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_productSimulator.cil.c[9250,9263] [2025-03-03 14:23:46,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:46,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:46,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [276] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [386] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [403] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [412] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [778] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1356] [2025-03-03 14:23:46,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1753] [2025-03-03 14:23:46,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2030] [2025-03-03 14:23:46,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3101] [2025-03-03 14:23:46,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [3450] [2025-03-03 14:23:46,171 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_productSimulator.cil.c[9250,9263] [2025-03-03 14:23:46,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:46,270 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:46,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:46 WrapperNode [2025-03-03 14:23:46,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:46,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:46,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:46,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:46,276 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:46" (1/1) ... [2025-03-03 14:23:46,295 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:46" (1/1) ... [2025-03-03 14:23:46,329 INFO L138 Inliner]: procedures = 152, calls = 270, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1346 [2025-03-03 14:23:46,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:46,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:46,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:46,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:46,336 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:46" (1/1) ... [2025-03-03 14:23:46,336 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:46" (1/1) ... [2025-03-03 14:23:46,342 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:46" (1/1) ... [2025-03-03 14:23:46,377 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:46,377 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:46" (1/1) ... [2025-03-03 14:23:46,377 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:46" (1/1) ... [2025-03-03 14:23:46,407 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:46" (1/1) ... [2025-03-03 14:23:46,410 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:46" (1/1) ... [2025-03-03 14:23:46,417 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:46" (1/1) ... [2025-03-03 14:23:46,420 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:46" (1/1) ... [2025-03-03 14:23:46,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:46,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:46,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:46,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:46,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:46" (1/1) ... [2025-03-03 14:23:46,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:46,465 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:46,467 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:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:23:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:23:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:23:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:23:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:23:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:23:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:23:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:23:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:23:46,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:23:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:46,485 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:46,485 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:23:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:46,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:46,676 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:46,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: #res := ~retValue_acc~0; [2025-03-03 14:23:46,741 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1660: #res := ~retValue_acc~24; [2025-03-03 14:23:46,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: #res := ~retValue_acc~15; [2025-03-03 14:23:46,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: #res := ~retValue_acc~36; [2025-03-03 14:23:46,830 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2187: #res := ~retValue_acc~30; [2025-03-03 14:23:46,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1397-1: getEmailId_#res#1 := getEmailId_~retValue_acc~17#1; [2025-03-03 14:23:46,883 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1623: #res := ~retValue_acc~23; [2025-03-03 14:23:46,911 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: #res := ~retValue_acc~19; [2025-03-03 14:23:46,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: #res#1 := ~retValue_acc~2#1; [2025-03-03 14:23:46,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L231-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~1#1; [2025-03-03 14:23:47,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:23:47,018 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:23:47,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: #res := ~retValue_acc~41; [2025-03-03 14:23:47,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L273-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-03 14:23:47,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1586: #res := ~retValue_acc~22; [2025-03-03 14:23:47,132 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3078-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:23:47,174 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~42#1; [2025-03-03 14:23:47,174 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1734-1: isVerified_#res#1 := isVerified_~retValue_acc~26#1; [2025-03-03 14:23:47,181 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1697: #res := ~retValue_acc~25; [2025-03-03 14:23:47,213 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: #res := ~retValue_acc~5; [2025-03-03 14:23:47,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: #res := ~retValue_acc~34; [2025-03-03 14:23:47,252 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2596-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~35#1; [2025-03-03 14:23:47,534 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L383-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-03 14:23:47,534 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-03 14:23:47,534 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2798-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:23:47,534 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1200-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-03 14:23:47,535 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2905-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:23:47,535 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1191-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-03 14:23:47,540 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1434: #res := ~retValue_acc~18; [2025-03-03 14:23:47,721 INFO L? ?]: Removed 633 outVars from TransFormulas that were not future-live. [2025-03-03 14:23:47,722 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:23:47,746 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:23:47,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:23:47,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:47 BoogieIcfgContainer [2025-03-03 14:23:47,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:23:47,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:23:47,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:23:47,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:23:47,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:45" (1/3) ... [2025-03-03 14:23:47,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7350ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:47, skipping insertion in model container [2025-03-03 14:23:47,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:46" (2/3) ... [2025-03-03 14:23:47,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7350ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:47, skipping insertion in model container [2025-03-03 14:23:47,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:47" (3/3) ... [2025-03-03 14:23:47,753 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_productSimulator.cil.c [2025-03-03 14:23:47,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:23:47,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_productSimulator.cil.c that has 45 procedures, 613 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:23:47,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:23:47,849 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;@e851251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:23:47,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:23:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 613 states, 452 states have (on average 1.511061946902655) internal successors, (683), 474 states have internal predecessors, (683), 115 states have call successors, (115), 44 states have call predecessors, (115), 44 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 14:23:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:23:47,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:47,879 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:47,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1186821837, now seen corresponding path program 1 times [2025-03-03 14:23:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327627546] [2025-03-03 14:23:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:47,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:23:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:23:48,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:48,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:23:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327627546] [2025-03-03 14:23:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327627546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:23:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806745807] [2025-03-03 14:23:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:23:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:48,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:23:48,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:23:48,240 INFO L87 Difference]: Start difference. First operand has 613 states, 452 states have (on average 1.511061946902655) internal successors, (683), 474 states have internal predecessors, (683), 115 states have call successors, (115), 44 states have call predecessors, (115), 44 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:23:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:48,295 INFO L93 Difference]: Finished difference Result 957 states and 1409 transitions. [2025-03-03 14:23:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:23:48,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 152 [2025-03-03 14:23:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:48,308 INFO L225 Difference]: With dead ends: 957 [2025-03-03 14:23:48,308 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 14:23:48,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:23:48,314 INFO L435 NwaCegarLoop]: 908 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, 908 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:48,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 908 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:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 14:23:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-03-03 14:23:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 446 states have (on average 1.5089686098654709) internal successors, (673), 466 states have internal predecessors, (673), 115 states have call successors, (115), 44 states have call predecessors, (115), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:23:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 900 transitions. [2025-03-03 14:23:48,380 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 900 transitions. Word has length 152 [2025-03-03 14:23:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:48,381 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 900 transitions. [2025-03-03 14:23:48,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:23:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 900 transitions. [2025-03-03 14:23:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:23:48,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:48,385 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:23:48,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:48,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1757016981, now seen corresponding path program 1 times [2025-03-03 14:23:48,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926082561] [2025-03-03 14:23:48,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:48,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:23:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:23:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:23:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926082561] [2025-03-03 14:23:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926082561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367948981] [2025-03-03 14:23:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:48,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:48,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:48,733 INFO L87 Difference]: Start difference. First operand 605 states and 900 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:23:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:48,847 INFO L93 Difference]: Finished difference Result 1174 states and 1744 transitions. [2025-03-03 14:23:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 153 [2025-03-03 14:23:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:48,853 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:23:48,853 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 14:23:48,856 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:48,857 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:48,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3580 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 14:23:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-03-03 14:23:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 446 states have (on average 1.493273542600897) internal successors, (666), 466 states have internal predecessors, (666), 115 states have call successors, (115), 44 states have call predecessors, (115), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:23:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 893 transitions. [2025-03-03 14:23:48,895 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 893 transitions. Word has length 153 [2025-03-03 14:23:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:48,895 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 893 transitions. [2025-03-03 14:23:48,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:23:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 893 transitions. [2025-03-03 14:23:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:23:48,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:48,898 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:23:48,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:48,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1381167332, now seen corresponding path program 1 times [2025-03-03 14:23:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:48,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40896689] [2025-03-03 14:23:48,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:48,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:23:48,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:23:48,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:48,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 14:23:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40896689] [2025-03-03 14:23:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40896689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588924555] [2025-03-03 14:23:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:49,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:49,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:49,066 INFO L87 Difference]: Start difference. First operand 605 states and 893 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:23:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:49,126 INFO L93 Difference]: Finished difference Result 1180 states and 1757 transitions. [2025-03-03 14:23:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2025-03-03 14:23:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:49,135 INFO L225 Difference]: With dead ends: 1180 [2025-03-03 14:23:49,135 INFO L226 Difference]: Without dead ends: 606 [2025-03-03 14:23:49,138 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:49,140 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 857 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:49,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 900 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-03 14:23:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-03-03 14:23:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 448 states have (on average 1.4821428571428572) internal successors, (664), 466 states have internal predecessors, (664), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 14:23:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 887 transitions. [2025-03-03 14:23:49,174 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 887 transitions. Word has length 179 [2025-03-03 14:23:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:49,174 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 887 transitions. [2025-03-03 14:23:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:23:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 887 transitions. [2025-03-03 14:23:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:23:49,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:49,178 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:23:49,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1170277746, now seen corresponding path program 1 times [2025-03-03 14:23:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774337718] [2025-03-03 14:23:49,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:49,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:23:49,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:23:49,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:49,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:23:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774337718] [2025-03-03 14:23:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774337718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135284691] [2025-03-03 14:23:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:49,303 INFO L87 Difference]: Start difference. First operand 606 states and 887 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:23:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:49,348 INFO L93 Difference]: Finished difference Result 1174 states and 1736 transitions. [2025-03-03 14:23:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 168 [2025-03-03 14:23:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:49,353 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:23:49,353 INFO L226 Difference]: Without dead ends: 604 [2025-03-03 14:23:49,355 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:49,356 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 837 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:49,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 913 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-03 14:23:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-03 14:23:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 448 states have (on average 1.4754464285714286) internal successors, (661), 464 states have internal predecessors, (661), 111 states have call successors, (111), 45 states have call predecessors, (111), 44 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:23:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 880 transitions. [2025-03-03 14:23:49,394 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 880 transitions. Word has length 168 [2025-03-03 14:23:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 880 transitions. [2025-03-03 14:23:49,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:23:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 880 transitions. [2025-03-03 14:23:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:23:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:49,399 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:23:49,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490632, now seen corresponding path program 1 times [2025-03-03 14:23:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019773272] [2025-03-03 14:23:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:49,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:23:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:23:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 14:23:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019773272] [2025-03-03 14:23:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019773272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074581662] [2025-03-03 14:23:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:49,505 INFO L87 Difference]: Start difference. First operand 604 states and 880 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:49,587 INFO L93 Difference]: Finished difference Result 1165 states and 1702 transitions. [2025-03-03 14:23:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2025-03-03 14:23:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:49,594 INFO L225 Difference]: With dead ends: 1165 [2025-03-03 14:23:49,594 INFO L226 Difference]: Without dead ends: 607 [2025-03-03 14:23:49,595 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:49,596 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 817 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:49,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 896 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-03 14:23:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 601. [2025-03-03 14:23:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 448 states have (on average 1.4508928571428572) internal successors, (650), 459 states have internal predecessors, (650), 108 states have call successors, (108), 45 states have call predecessors, (108), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:23:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 863 transitions. [2025-03-03 14:23:49,634 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 863 transitions. Word has length 176 [2025-03-03 14:23:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:49,634 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 863 transitions. [2025-03-03 14:23:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:23:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 863 transitions. [2025-03-03 14:23:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 14:23:49,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:49,637 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:23:49,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -310757192, now seen corresponding path program 1 times [2025-03-03 14:23:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243854996] [2025-03-03 14:23:49,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:49,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:23:49,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:23:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 14:23:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243854996] [2025-03-03 14:23:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243854996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876113186] [2025-03-03 14:23:49,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:49,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:49,957 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:49,958 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:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:23:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:23:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:50,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:23:50,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:23:50,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876113186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:50,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:50,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:23:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584526089] [2025-03-03 14:23:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:50,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:50,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:50,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:50,360 INFO L87 Difference]: Start difference. First operand 601 states and 863 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:50,417 INFO L93 Difference]: Finished difference Result 937 states and 1327 transitions. [2025-03-03 14:23:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 194 [2025-03-03 14:23:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:50,423 INFO L225 Difference]: With dead ends: 937 [2025-03-03 14:23:50,423 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 14:23:50,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:50,425 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 0 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1718 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:50,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1718 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:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 14:23:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-03-03 14:23:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 450 states have (on average 1.448888888888889) internal successors, (652), 461 states have internal predecessors, (652), 108 states have call successors, (108), 45 states have call predecessors, (108), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:23:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 865 transitions. [2025-03-03 14:23:50,467 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 865 transitions. Word has length 194 [2025-03-03 14:23:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:50,468 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 865 transitions. [2025-03-03 14:23:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 865 transitions. [2025-03-03 14:23:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 14:23:50,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:50,473 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,483 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:50,673 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,SelfDestructingSolverStorable5 [2025-03-03 14:23:50,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -197450884, now seen corresponding path program 1 times [2025-03-03 14:23:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211463383] [2025-03-03 14:23:50,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:23:50,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:23:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:23:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211463383] [2025-03-03 14:23:50,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211463383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442776851] [2025-03-03 14:23:50,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:50,997 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:50,998 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:51,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:23:51,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:23:51,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:51,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:51,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:23:51,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442776851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:51,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:23:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354244524] [2025-03-03 14:23:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:51,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:51,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:51,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:51,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:51,397 INFO L87 Difference]: Start difference. First operand 603 states and 865 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:51,438 INFO L93 Difference]: Finished difference Result 1225 states and 1790 transitions. [2025-03-03 14:23:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 194 [2025-03-03 14:23:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:51,443 INFO L225 Difference]: With dead ends: 1225 [2025-03-03 14:23:51,443 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 14:23:51,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:51,445 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 165 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1685 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:51,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1685 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:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 14:23:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 692. [2025-03-03 14:23:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 525 states have (on average 1.4647619047619047) internal successors, (769), 536 states have internal predecessors, (769), 122 states have call successors, (122), 45 states have call predecessors, (122), 44 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 14:23:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1010 transitions. [2025-03-03 14:23:51,479 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1010 transitions. Word has length 194 [2025-03-03 14:23:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1010 transitions. [2025-03-03 14:23:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1010 transitions. [2025-03-03 14:23:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:23:51,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:51,483 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:51,687 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,SelfDestructingSolverStorable6 [2025-03-03 14:23:51,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:51,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1281630502, now seen corresponding path program 1 times [2025-03-03 14:23:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344153299] [2025-03-03 14:23:51,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:51,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:23:51,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:23:51,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:51,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:23:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344153299] [2025-03-03 14:23:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344153299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5044161] [2025-03-03 14:23:51,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:51,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:51,936 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:51,937 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:52,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:23:52,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:23:52,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:52,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:52,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:23:52,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:23:52,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5044161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:52,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:52,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:23:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769995847] [2025-03-03 14:23:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:52,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:52,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:23:52,368 INFO L87 Difference]: Start difference. First operand 692 states and 1010 transitions. Second operand has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:52,480 INFO L93 Difference]: Finished difference Result 1331 states and 1957 transitions. [2025-03-03 14:23:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:23:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 195 [2025-03-03 14:23:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:52,487 INFO L225 Difference]: With dead ends: 1331 [2025-03-03 14:23:52,487 INFO L226 Difference]: Without dead ends: 694 [2025-03-03 14:23:52,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:23:52,490 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 4 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:52,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5933 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-03 14:23:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-03 14:23:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 526 states have (on average 1.4638783269961977) internal successors, (770), 538 states have internal predecessors, (770), 122 states have call successors, (122), 45 states have call predecessors, (122), 45 states have return successors, (121), 118 states have call predecessors, (121), 119 states have call successors, (121) [2025-03-03 14:23:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1013 transitions. [2025-03-03 14:23:52,525 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1013 transitions. Word has length 195 [2025-03-03 14:23:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:52,525 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1013 transitions. [2025-03-03 14:23:52,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1013 transitions. [2025-03-03 14:23:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 14:23:52,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:52,528 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,537 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:52,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:52,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 531151884, now seen corresponding path program 1 times [2025-03-03 14:23:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549295921] [2025-03-03 14:23:52,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:52,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 14:23:52,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 14:23:52,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:52,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:23:52,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549295921] [2025-03-03 14:23:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549295921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063237416] [2025-03-03 14:23:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:52,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:52,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:52,931 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:52,933 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:53,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 14:23:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 14:23:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:53,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:23:53,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:23:53,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063237416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:53,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:23:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825199400] [2025-03-03 14:23:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:53,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:23:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:53,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:23:53,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:23:53,414 INFO L87 Difference]: Start difference. First operand 694 states and 1013 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 14:23:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:53,488 INFO L93 Difference]: Finished difference Result 1332 states and 1961 transitions. [2025-03-03 14:23:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:23:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 196 [2025-03-03 14:23:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:53,492 INFO L225 Difference]: With dead ends: 1332 [2025-03-03 14:23:53,493 INFO L226 Difference]: Without dead ends: 696 [2025-03-03 14:23:53,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:23:53,495 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 2 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:53,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-03 14:23:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2025-03-03 14:23:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 527 states have (on average 1.462998102466793) internal successors, (771), 540 states have internal predecessors, (771), 122 states have call successors, (122), 45 states have call predecessors, (122), 46 states have return successors, (126), 118 states have call predecessors, (126), 119 states have call successors, (126) [2025-03-03 14:23:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1019 transitions. [2025-03-03 14:23:53,524 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1019 transitions. Word has length 196 [2025-03-03 14:23:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:53,524 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1019 transitions. [2025-03-03 14:23:53,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 14:23:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1019 transitions. [2025-03-03 14:23:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:23:53,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:53,528 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:23:53,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:53,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:53,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -693272670, now seen corresponding path program 1 times [2025-03-03 14:23:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384953187] [2025-03-03 14:23:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:53,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:23:53,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:23:53,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:23:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384953187] [2025-03-03 14:23:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384953187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893244976] [2025-03-03 14:23:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:53,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:53,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:53,953 INFO L87 Difference]: Start difference. First operand 696 states and 1019 transitions. Second operand has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-03 14:23:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:54,040 INFO L93 Difference]: Finished difference Result 1320 states and 1948 transitions. [2025-03-03 14:23:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:23:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 204 [2025-03-03 14:23:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:54,045 INFO L225 Difference]: With dead ends: 1320 [2025-03-03 14:23:54,045 INFO L226 Difference]: Without dead ends: 696 [2025-03-03 14:23:54,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:54,046 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4 mSDsluCounter, 5089 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5940 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:54,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5940 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-03 14:23:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2025-03-03 14:23:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 527 states have (on average 1.462998102466793) internal successors, (771), 540 states have internal predecessors, (771), 122 states have call successors, (122), 45 states have call predecessors, (122), 46 states have return successors, (125), 118 states have call predecessors, (125), 119 states have call successors, (125) [2025-03-03 14:23:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1018 transitions. [2025-03-03 14:23:54,071 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1018 transitions. Word has length 204 [2025-03-03 14:23:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1018 transitions. [2025-03-03 14:23:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-03 14:23:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1018 transitions. [2025-03-03 14:23:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 14:23:54,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:54,074 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:23:54,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1528325818, now seen corresponding path program 1 times [2025-03-03 14:23:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:54,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346361207] [2025-03-03 14:23:54,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 14:23:54,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 14:23:54,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:54,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:23:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346361207] [2025-03-03 14:23:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346361207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:54,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39503613] [2025-03-03 14:23:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:54,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:54,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:54,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:54,272 INFO L87 Difference]: Start difference. First operand 696 states and 1018 transitions. Second operand has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:54,360 INFO L93 Difference]: Finished difference Result 1322 states and 1951 transitions. [2025-03-03 14:23:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:23:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 198 [2025-03-03 14:23:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:54,365 INFO L225 Difference]: With dead ends: 1322 [2025-03-03 14:23:54,366 INFO L226 Difference]: Without dead ends: 698 [2025-03-03 14:23:54,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:54,368 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 3 mSDsluCounter, 5094 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5946 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5946 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-03 14:23:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-03 14:23:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 542 states have internal predecessors, (772), 122 states have call successors, (122), 45 states have call predecessors, (122), 47 states have return successors, (127), 118 states have call predecessors, (127), 119 states have call successors, (127) [2025-03-03 14:23:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2025-03-03 14:23:54,393 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 198 [2025-03-03 14:23:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2025-03-03 14:23:54,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2025-03-03 14:23:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 14:23:54,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:54,396 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:23:54,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:54,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1422195270, now seen corresponding path program 1 times [2025-03-03 14:23:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981734570] [2025-03-03 14:23:54,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:54,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 14:23:54,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 14:23:54,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:54,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:23:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:54,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981734570] [2025-03-03 14:23:54,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981734570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:54,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:23:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049166547] [2025-03-03 14:23:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:23:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:54,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:23:54,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:54,572 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 9 states, 7 states have (on average 18.571428571428573) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-03 14:23:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:54,721 INFO L93 Difference]: Finished difference Result 1319 states and 1945 transitions. [2025-03-03 14:23:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:23:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 18.571428571428573) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 227 [2025-03-03 14:23:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:54,726 INFO L225 Difference]: With dead ends: 1319 [2025-03-03 14:23:54,726 INFO L226 Difference]: Without dead ends: 698 [2025-03-03 14:23:54,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:54,728 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 7 mSDsluCounter, 5878 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:54,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6722 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-03 14:23:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-03 14:23:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 542 states have internal predecessors, (772), 122 states have call successors, (122), 45 states have call predecessors, (122), 47 states have return successors, (126), 118 states have call predecessors, (126), 119 states have call successors, (126) [2025-03-03 14:23:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1020 transitions. [2025-03-03 14:23:54,752 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1020 transitions. Word has length 227 [2025-03-03 14:23:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:54,752 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1020 transitions. [2025-03-03 14:23:54,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 18.571428571428573) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-03 14:23:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1020 transitions. [2025-03-03 14:23:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 14:23:54,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:54,755 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:23:54,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -192944193, now seen corresponding path program 1 times [2025-03-03 14:23:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332267216] [2025-03-03 14:23:54,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 14:23:54,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 14:23:54,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:54,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:23:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332267216] [2025-03-03 14:23:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332267216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:23:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3893760] [2025-03-03 14:23:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:54,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:23:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:54,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:23:54,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:54,901 INFO L87 Difference]: Start difference. First operand 698 states and 1020 transitions. Second operand has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:55,026 INFO L93 Difference]: Finished difference Result 1321 states and 1951 transitions. [2025-03-03 14:23:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:23:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 200 [2025-03-03 14:23:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:55,031 INFO L225 Difference]: With dead ends: 1321 [2025-03-03 14:23:55,031 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 14:23:55,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:55,033 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:55,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6738 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 14:23:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-03-03 14:23:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 529 states have (on average 1.4612476370510397) internal successors, (773), 544 states have internal predecessors, (773), 122 states have call successors, (122), 45 states have call predecessors, (122), 48 states have return successors, (131), 118 states have call predecessors, (131), 119 states have call successors, (131) [2025-03-03 14:23:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1026 transitions. [2025-03-03 14:23:55,055 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1026 transitions. Word has length 200 [2025-03-03 14:23:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:55,056 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1026 transitions. [2025-03-03 14:23:55,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-03 14:23:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1026 transitions. [2025-03-03 14:23:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 14:23:55,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:55,058 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:23:55,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2042939904, now seen corresponding path program 1 times [2025-03-03 14:23:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528366493] [2025-03-03 14:23:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:55,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:23:55,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:23:55,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:55,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528366493] [2025-03-03 14:23:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528366493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100086529] [2025-03-03 14:23:55,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:55,190 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:55,191 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:55,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:23:55,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:23:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:55,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:55,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:55,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100086529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:55,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:55,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:23:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201090501] [2025-03-03 14:23:55,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:23:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:55,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:23:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:55,624 INFO L87 Difference]: Start difference. First operand 700 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 14:23:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:55,779 INFO L93 Difference]: Finished difference Result 1592 states and 2407 transitions. [2025-03-03 14:23:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:23:55,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-03-03 14:23:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:55,787 INFO L225 Difference]: With dead ends: 1592 [2025-03-03 14:23:55,787 INFO L226 Difference]: Without dead ends: 1258 [2025-03-03 14:23:55,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:55,789 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 719 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:55,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2358 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-03 14:23:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1234. [2025-03-03 14:23:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 984 states have (on average 1.516260162601626) internal successors, (1492), 999 states have internal predecessors, (1492), 201 states have call successors, (201), 45 states have call predecessors, (201), 48 states have return successors, (220), 197 states have call predecessors, (220), 198 states have call successors, (220) [2025-03-03 14:23:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1913 transitions. [2025-03-03 14:23:55,837 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1913 transitions. Word has length 201 [2025-03-03 14:23:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:55,838 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1913 transitions. [2025-03-03 14:23:55,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 14:23:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1913 transitions. [2025-03-03 14:23:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 14:23:55,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:55,844 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 14:23:56,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1809665685, now seen corresponding path program 1 times [2025-03-03 14:23:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930811232] [2025-03-03 14:23:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:56,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 14:23:56,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 14:23:56,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:56,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:56,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930811232] [2025-03-03 14:23:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930811232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:56,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:56,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186291229] [2025-03-03 14:23:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:56,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:56,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:56,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:56,129 INFO L87 Difference]: Start difference. First operand 1234 states and 1913 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:56,180 INFO L93 Difference]: Finished difference Result 2839 states and 4472 transitions. [2025-03-03 14:23:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 205 [2025-03-03 14:23:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:56,189 INFO L225 Difference]: With dead ends: 2839 [2025-03-03 14:23:56,190 INFO L226 Difference]: Without dead ends: 1738 [2025-03-03 14:23:56,193 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:56,194 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 163 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1726 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:56,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1726 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:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-03-03 14:23:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1730. [2025-03-03 14:23:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1401 states have (on average 1.529621698786581) internal successors, (2143), 1416 states have internal predecessors, (2143), 280 states have call successors, (280), 45 states have call predecessors, (280), 48 states have return successors, (309), 276 states have call predecessors, (309), 277 states have call successors, (309) [2025-03-03 14:23:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2732 transitions. [2025-03-03 14:23:56,273 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2732 transitions. Word has length 205 [2025-03-03 14:23:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2732 transitions. [2025-03-03 14:23:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2732 transitions. [2025-03-03 14:23:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 14:23:56,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:56,283 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:23:56,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:56,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 599586117, now seen corresponding path program 1 times [2025-03-03 14:23:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435667041] [2025-03-03 14:23:56,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:56,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 14:23:56,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 14:23:56,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:56,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 14:23:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435667041] [2025-03-03 14:23:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435667041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201682107] [2025-03-03 14:23:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:56,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:56,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:56,354 INFO L87 Difference]: Start difference. First operand 1730 states and 2732 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:23:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:56,411 INFO L93 Difference]: Finished difference Result 4075 states and 6502 transitions. [2025-03-03 14:23:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2025-03-03 14:23:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:56,425 INFO L225 Difference]: With dead ends: 4075 [2025-03-03 14:23:56,425 INFO L226 Difference]: Without dead ends: 2539 [2025-03-03 14:23:56,430 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:56,430 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 161 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1716 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:56,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1716 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:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2025-03-03 14:23:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2531. [2025-03-03 14:23:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2083 states have (on average 1.543446951512242) internal successors, (3215), 2098 states have internal predecessors, (3215), 399 states have call successors, (399), 45 states have call predecessors, (399), 48 states have return successors, (428), 395 states have call predecessors, (428), 396 states have call successors, (428) [2025-03-03 14:23:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4042 transitions. [2025-03-03 14:23:56,514 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 4042 transitions. Word has length 234 [2025-03-03 14:23:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 4042 transitions. [2025-03-03 14:23:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:23:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 4042 transitions. [2025-03-03 14:23:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 14:23:56,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:56,526 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:56,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash -877612200, now seen corresponding path program 1 times [2025-03-03 14:23:56,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:56,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914939559] [2025-03-03 14:23:56,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:56,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 14:23:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 14:23:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 14:23:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914939559] [2025-03-03 14:23:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914939559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757737706] [2025-03-03 14:23:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:56,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:56,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:56,610 INFO L87 Difference]: Start difference. First operand 2531 states and 4042 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:56,684 INFO L93 Difference]: Finished difference Result 5956 states and 9607 transitions. [2025-03-03 14:23:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:56,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 214 [2025-03-03 14:23:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:56,702 INFO L225 Difference]: With dead ends: 5956 [2025-03-03 14:23:56,703 INFO L226 Difference]: Without dead ends: 3773 [2025-03-03 14:23:56,709 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:56,710 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 159 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1709 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:56,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1709 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:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2025-03-03 14:23:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3765. [2025-03-03 14:23:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3155 states have (on average 1.5549920760697307) internal successors, (4906), 3170 states have internal predecessors, (4906), 561 states have call successors, (561), 45 states have call predecessors, (561), 48 states have return successors, (606), 557 states have call predecessors, (606), 558 states have call successors, (606) [2025-03-03 14:23:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 6073 transitions. [2025-03-03 14:23:56,873 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 6073 transitions. Word has length 214 [2025-03-03 14:23:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 6073 transitions. [2025-03-03 14:23:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 6073 transitions. [2025-03-03 14:23:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:23:56,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:56,889 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:56,889 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash 294464643, now seen corresponding path program 1 times [2025-03-03 14:23:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064058607] [2025-03-03 14:23:56,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:56,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:23:56,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:23:56,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064058607] [2025-03-03 14:23:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064058607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960419277] [2025-03-03 14:23:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:56,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:56,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:56,981 INFO L87 Difference]: Start difference. First operand 3765 states and 6073 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:57,090 INFO L93 Difference]: Finished difference Result 8927 states and 14528 transitions. [2025-03-03 14:23:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 208 [2025-03-03 14:23:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:57,120 INFO L225 Difference]: With dead ends: 8927 [2025-03-03 14:23:57,120 INFO L226 Difference]: Without dead ends: 5765 [2025-03-03 14:23:57,131 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:57,132 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 157 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1709 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:57,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1709 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:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2025-03-03 14:23:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5757. [2025-03-03 14:23:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 4902 states have (on average 1.5646674826601388) internal successors, (7670), 4917 states have internal predecessors, (7670), 806 states have call successors, (806), 45 states have call predecessors, (806), 48 states have return successors, (877), 802 states have call predecessors, (877), 803 states have call successors, (877) [2025-03-03 14:23:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 9353 transitions. [2025-03-03 14:23:57,368 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 9353 transitions. Word has length 208 [2025-03-03 14:23:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:57,369 INFO L471 AbstractCegarLoop]: Abstraction has 5757 states and 9353 transitions. [2025-03-03 14:23:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:23:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 9353 transitions. [2025-03-03 14:23:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 14:23:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:57,386 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:57,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:57,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1440017369, now seen corresponding path program 1 times [2025-03-03 14:23:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581038479] [2025-03-03 14:23:57,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:57,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 14:23:57,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 14:23:57,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:57,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 14:23:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581038479] [2025-03-03 14:23:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581038479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:57,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978739541] [2025-03-03 14:23:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:57,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:57,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:57,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:57,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:57,446 INFO L87 Difference]: Start difference. First operand 5757 states and 9353 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:57,632 INFO L93 Difference]: Finished difference Result 13864 states and 22670 transitions. [2025-03-03 14:23:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 216 [2025-03-03 14:23:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:57,671 INFO L225 Difference]: With dead ends: 13864 [2025-03-03 14:23:57,671 INFO L226 Difference]: Without dead ends: 9101 [2025-03-03 14:23:57,686 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:57,686 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 155 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1717 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:57,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1717 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:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2025-03-03 14:23:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 9093. [2025-03-03 14:23:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9093 states, 7745 states have (on average 1.5629438347320852) internal successors, (12105), 7760 states have internal predecessors, (12105), 1299 states have call successors, (1299), 45 states have call predecessors, (1299), 48 states have return successors, (1414), 1295 states have call predecessors, (1414), 1296 states have call successors, (1414) [2025-03-03 14:23:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 14818 transitions. [2025-03-03 14:23:58,115 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 14818 transitions. Word has length 216 [2025-03-03 14:23:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:58,115 INFO L471 AbstractCegarLoop]: Abstraction has 9093 states and 14818 transitions. [2025-03-03 14:23:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 14818 transitions. [2025-03-03 14:23:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 14:23:58,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:58,142 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:58,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:58,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1442362503, now seen corresponding path program 1 times [2025-03-03 14:23:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:58,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543018566] [2025-03-03 14:23:58,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 14:23:58,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 14:23:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 14:23:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543018566] [2025-03-03 14:23:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543018566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494901069] [2025-03-03 14:23:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:58,205 INFO L87 Difference]: Start difference. First operand 9093 states and 14818 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:23:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:58,452 INFO L93 Difference]: Finished difference Result 22712 states and 37330 transitions. [2025-03-03 14:23:58,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:58,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 238 [2025-03-03 14:23:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:58,498 INFO L225 Difference]: With dead ends: 22712 [2025-03-03 14:23:58,498 INFO L226 Difference]: Without dead ends: 15103 [2025-03-03 14:23:58,524 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:58,527 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 153 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1714 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:58,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1714 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:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15103 states. [2025-03-03 14:23:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15103 to 15095. [2025-03-03 14:23:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15095 states, 12925 states have (on average 1.5694390715667312) internal successors, (20285), 12940 states have internal predecessors, (20285), 2121 states have call successors, (2121), 45 states have call predecessors, (2121), 48 states have return successors, (2314), 2117 states have call predecessors, (2314), 2118 states have call successors, (2314) [2025-03-03 14:23:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15095 states to 15095 states and 24720 transitions. [2025-03-03 14:23:59,044 INFO L78 Accepts]: Start accepts. Automaton has 15095 states and 24720 transitions. Word has length 238 [2025-03-03 14:23:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:59,045 INFO L471 AbstractCegarLoop]: Abstraction has 15095 states and 24720 transitions. [2025-03-03 14:23:59,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:23:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15095 states and 24720 transitions. [2025-03-03 14:23:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 14:23:59,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:59,072 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:59,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2035014842, now seen corresponding path program 1 times [2025-03-03 14:23:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360391639] [2025-03-03 14:23:59,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:59,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 14:23:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 14:23:59,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 14:23:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360391639] [2025-03-03 14:23:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360391639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691765231] [2025-03-03 14:23:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:59,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:59,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:59,131 INFO L87 Difference]: Start difference. First operand 15095 states and 24720 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:23:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:59,591 INFO L93 Difference]: Finished difference Result 36319 states and 59231 transitions. [2025-03-03 14:23:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:59,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 218 [2025-03-03 14:23:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:59,665 INFO L225 Difference]: With dead ends: 36319 [2025-03-03 14:23:59,665 INFO L226 Difference]: Without dead ends: 23835 [2025-03-03 14:23:59,692 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:59,693 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 151 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1710 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:59,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1710 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:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23835 states. [2025-03-03 14:24:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23835 to 23827. [2025-03-03 14:24:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23827 states, 20454 states have (on average 1.5432678204752126) internal successors, (31566), 20469 states have internal predecessors, (31566), 3324 states have call successors, (3324), 45 states have call predecessors, (3324), 48 states have return successors, (3661), 3320 states have call predecessors, (3661), 3321 states have call successors, (3661) [2025-03-03 14:24:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23827 states to 23827 states and 38551 transitions. [2025-03-03 14:24:00,747 INFO L78 Accepts]: Start accepts. Automaton has 23827 states and 38551 transitions. Word has length 218 [2025-03-03 14:24:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:00,748 INFO L471 AbstractCegarLoop]: Abstraction has 23827 states and 38551 transitions. [2025-03-03 14:24:00,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:24:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 23827 states and 38551 transitions. [2025-03-03 14:24:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 14:24:00,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:00,781 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:00,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:24:00,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1966108347, now seen corresponding path program 1 times [2025-03-03 14:24:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567896842] [2025-03-03 14:24:00,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:00,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 14:24:00,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 14:24:00,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:00,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:24:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:00,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567896842] [2025-03-03 14:24:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567896842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:00,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793338636] [2025-03-03 14:24:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:00,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:00,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:00,844 INFO L87 Difference]: Start difference. First operand 23827 states and 38551 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:24:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:01,671 INFO L93 Difference]: Finished difference Result 62777 states and 101984 transitions. [2025-03-03 14:24:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 212 [2025-03-03 14:24:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:01,801 INFO L225 Difference]: With dead ends: 62777 [2025-03-03 14:24:01,802 INFO L226 Difference]: Without dead ends: 42365 [2025-03-03 14:24:01,842 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:24:01,843 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 149 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:01,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1713 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42365 states. [2025-03-03 14:24:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42365 to 42357. [2025-03-03 14:24:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42357 states, 36534 states have (on average 1.5437674494990967) internal successors, (56400), 36549 states have internal predecessors, (56400), 5774 states have call successors, (5774), 45 states have call predecessors, (5774), 48 states have return successors, (6385), 5770 states have call predecessors, (6385), 5771 states have call successors, (6385) [2025-03-03 14:24:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42357 states to 42357 states and 68559 transitions. [2025-03-03 14:24:03,001 INFO L78 Accepts]: Start accepts. Automaton has 42357 states and 68559 transitions. Word has length 212 [2025-03-03 14:24:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 42357 states and 68559 transitions. [2025-03-03 14:24:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:24:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42357 states and 68559 transitions. [2025-03-03 14:24:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 14:24:03,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:03,044 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:24:03,044 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash 189649159, now seen corresponding path program 1 times [2025-03-03 14:24:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916349090] [2025-03-03 14:24:03,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:03,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 14:24:03,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 14:24:03,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:24:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916349090] [2025-03-03 14:24:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916349090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:03,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920515781] [2025-03-03 14:24:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:03,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:03,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:03,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:03,105 INFO L87 Difference]: Start difference. First operand 42357 states and 68559 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:24:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:05,152 INFO L93 Difference]: Finished difference Result 114659 states and 186626 transitions. [2025-03-03 14:24:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 213 [2025-03-03 14:24:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:05,473 INFO L225 Difference]: With dead ends: 114659 [2025-03-03 14:24:05,473 INFO L226 Difference]: Without dead ends: 76884 [2025-03-03 14:24:05,593 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:24:05,593 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 147 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1714 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:24:05,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1714 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76884 states. [2025-03-03 14:24:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76884 to 76876. [2025-03-03 14:24:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76876 states, 66540 states have (on average 1.5479260595130748) internal successors, (102999), 66555 states have internal predecessors, (102999), 10287 states have call successors, (10287), 45 states have call predecessors, (10287), 48 states have return successors, (11430), 10283 states have call predecessors, (11430), 10284 states have call successors, (11430) [2025-03-03 14:24:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76876 states to 76876 states and 124716 transitions. [2025-03-03 14:24:08,159 INFO L78 Accepts]: Start accepts. Automaton has 76876 states and 124716 transitions. Word has length 213 [2025-03-03 14:24:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 76876 states and 124716 transitions. [2025-03-03 14:24:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:24:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 76876 states and 124716 transitions. [2025-03-03 14:24:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 14:24:08,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:08,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:08,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:24:08,225 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 867326889, now seen corresponding path program 1 times [2025-03-03 14:24:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:08,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586503005] [2025-03-03 14:24:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:08,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 14:24:08,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 14:24:08,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:08,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 14:24:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586503005] [2025-03-03 14:24:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586503005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951328209] [2025-03-03 14:24:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:08,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:08,317 INFO L87 Difference]: Start difference. First operand 76876 states and 124716 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:24:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:11,147 INFO L93 Difference]: Finished difference Result 143610 states and 233808 transitions. [2025-03-03 14:24:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 242 [2025-03-03 14:24:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:11,678 INFO L225 Difference]: With dead ends: 143610 [2025-03-03 14:24:11,679 INFO L226 Difference]: Without dead ends: 143276 [2025-03-03 14:24:11,718 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:24:11,719 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 141 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1728 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:24:11,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1728 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143276 states. [2025-03-03 14:24:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143276 to 143268. [2025-03-03 14:24:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143268 states, 124564 states have (on average 1.5473732378536336) internal successors, (192747), 124579 states have internal predecessors, (192747), 18655 states have call successors, (18655), 45 states have call predecessors, (18655), 48 states have return successors, (20844), 18651 states have call predecessors, (20844), 18652 states have call successors, (20844) [2025-03-03 14:24:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143268 states to 143268 states and 232246 transitions. [2025-03-03 14:24:16,298 INFO L78 Accepts]: Start accepts. Automaton has 143268 states and 232246 transitions. Word has length 242 [2025-03-03 14:24:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:16,299 INFO L471 AbstractCegarLoop]: Abstraction has 143268 states and 232246 transitions. [2025-03-03 14:24:16,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:24:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 143268 states and 232246 transitions. [2025-03-03 14:24:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 14:24:16,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:16,375 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:24:16,375 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -713306938, now seen corresponding path program 1 times [2025-03-03 14:24:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727836401] [2025-03-03 14:24:16,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:16,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 14:24:16,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:24:16,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:16,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:24:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727836401] [2025-03-03 14:24:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727836401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438338470] [2025-03-03 14:24:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:16,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:16,633 INFO L87 Difference]: Start difference. First operand 143268 states and 232246 transitions. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 7 states have internal predecessors, (131), 6 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2025-03-03 14:24:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:20,332 INFO L93 Difference]: Finished difference Result 144532 states and 234042 transitions. [2025-03-03 14:24:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:24:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 7 states have internal predecessors, (131), 6 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 215 [2025-03-03 14:24:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:20,860 INFO L225 Difference]: With dead ends: 144532 [2025-03-03 14:24:20,860 INFO L226 Difference]: Without dead ends: 144206 [2025-03-03 14:24:20,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:24:20,922 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 3596 mSDsluCounter, 3626 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3610 SdHoareTripleChecker+Valid, 4879 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:20,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3610 Valid, 4879 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:24:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144206 states. [2025-03-03 14:24:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144206 to 144195. [2025-03-03 14:24:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144195 states, 125224 states have (on average 1.5465885133840158) internal successors, (193670), 125267 states have internal predecessors, (193670), 18830 states have call successors, (18830), 131 states have call predecessors, (18830), 140 states have return successors, (21048), 18827 states have call predecessors, (21048), 18818 states have call successors, (21048) [2025-03-03 14:24:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144195 states to 144195 states and 233548 transitions. [2025-03-03 14:24:25,108 INFO L78 Accepts]: Start accepts. Automaton has 144195 states and 233548 transitions. Word has length 215 [2025-03-03 14:24:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 144195 states and 233548 transitions. [2025-03-03 14:24:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 7 states have internal predecessors, (131), 6 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2025-03-03 14:24:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 144195 states and 233548 transitions. [2025-03-03 14:24:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-03 14:24:25,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:25,177 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:25,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:24:25,177 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:25,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash 943360409, now seen corresponding path program 1 times [2025-03-03 14:24:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:25,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939992233] [2025-03-03 14:24:25,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:25,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-03 14:24:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-03 14:24:25,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:25,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 14:24:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939992233] [2025-03-03 14:24:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939992233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364733758] [2025-03-03 14:24:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:25,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:25,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:25,251 INFO L87 Difference]: Start difference. First operand 144195 states and 233548 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29)