./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product31.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_spec4_product31.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 87743dcc2c25562bb963887f71637e8ebeccc1d21e21cc059ac68c446a3d9b4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:24:27,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:24:27,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:24:27,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:24:27,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:24:27,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:24:27,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:24:27,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:24:27,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:24:27,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:24:27,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:24:27,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:24:27,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:24:27,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:24:27,736 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:24:27,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:27,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:24:27,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:24:27,737 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 -> 87743dcc2c25562bb963887f71637e8ebeccc1d21e21cc059ac68c446a3d9b4f [2025-03-03 14:24:27,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:24:27,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:24:27,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:24:27,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:24:27,993 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:24:27,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product31.cil.c [2025-03-03 14:24:29,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3fec45/489440571fdf4d6cac9ca796acb4eb88/FLAGcc0406021 [2025-03-03 14:24:29,425 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:24:29,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product31.cil.c [2025-03-03 14:24:29,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3fec45/489440571fdf4d6cac9ca796acb4eb88/FLAGcc0406021 [2025-03-03 14:24:29,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3fec45/489440571fdf4d6cac9ca796acb4eb88 [2025-03-03 14:24:29,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:24:29,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:24:29,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:29,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:24:29,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:24:29,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:29" (1/1) ... [2025-03-03 14:24:29,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1d70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:29, skipping insertion in model container [2025-03-03 14:24:29,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:29" (1/1) ... [2025-03-03 14:24:29,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:24:29,972 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_spec4_product31.cil.c[26985,26998] [2025-03-03 14:24:30,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:30,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:24:30,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1128] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1137] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1503] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1810] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2222] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2580] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2607] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2742] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2777] [2025-03-03 14:24:30,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2794] [2025-03-03 14:24:30,177 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_spec4_product31.cil.c[26985,26998] [2025-03-03 14:24:30,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:30,261 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:24:30,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30 WrapperNode [2025-03-03 14:24:30,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:30,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:30,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:24:30,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:24:30,266 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:24:30" (1/1) ... [2025-03-03 14:24:30,282 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:24:30" (1/1) ... [2025-03-03 14:24:30,326 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1026 [2025-03-03 14:24:30,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:30,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:24:30,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:24:30,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:24:30,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,354 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:24:30,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:24:30,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:24:30,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:24:30,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:24:30,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (1/1) ... [2025-03-03 14:24:30,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:30,419 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:24:30,425 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:24:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:24:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:24:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:24:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:24:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:24:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:24:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:24:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:24:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:24:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:24:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:24:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:24:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:24:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:24:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:24:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:24:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:24:30,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:24:30,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:24:30,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2203-1: isVerified_#res#1 := isVerified_~retValue_acc~31#1; [2025-03-03 14:24:30,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-03 14:24:30,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866-1: getEmailId_#res#1 := getEmailId_~retValue_acc~22#1; [2025-03-03 14:24:30,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-03-03 14:24:30,901 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~29; [2025-03-03 14:24:30,914 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: #res := ~retValue_acc~36; [2025-03-03 14:24:30,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-03 14:24:30,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-03 14:24:30,964 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-03-03 14:24:30,976 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-03 14:24:30,986 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: createEmail_#res#1 := createEmail_~retValue_acc~40#1; [2025-03-03 14:24:30,997 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: #res := ~retValue_acc~27; [2025-03-03 14:24:31,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2092: #res := ~retValue_acc~28; [2025-03-03 14:24:31,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2166: #res := ~retValue_acc~30; [2025-03-03 14:24:31,033 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1940: #res := ~retValue_acc~24; [2025-03-03 14:24:31,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~33#1; [2025-03-03 14:24:31,272 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-03 14:24:31,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-03 14:24:31,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-03-03 14:24:31,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~34#1; [2025-03-03 14:24:31,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~35#1; [2025-03-03 14:24:31,279 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: #res := ~retValue_acc~23; [2025-03-03 14:24:31,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2715: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:24:31,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~37#1; [2025-03-03 14:24:31,406 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2025-03-03 14:24:31,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:24:31,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:24:31,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:24:31,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:31 BoogieIcfgContainer [2025-03-03 14:24:31,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:24:31,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:24:31,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:24:31,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:24:31,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:24:29" (1/3) ... [2025-03-03 14:24:31,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3e3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:31, skipping insertion in model container [2025-03-03 14:24:31,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:30" (2/3) ... [2025-03-03 14:24:31,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3e3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:31, skipping insertion in model container [2025-03-03 14:24:31,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:31" (3/3) ... [2025-03-03 14:24:31,434 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product31.cil.c [2025-03-03 14:24:31,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:24:31,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product31.cil.c that has 24 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:24:31,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:24:31,503 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;@5ff22c2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:24:31,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:24:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 14:24:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:24:31,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:31,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:31,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:31,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2030100056, now seen corresponding path program 1 times [2025-03-03 14:24:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138582218] [2025-03-03 14:24:31,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:31,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:24:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:24:31,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:31,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:24:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138582218] [2025-03-03 14:24:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138582218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870105540] [2025-03-03 14:24:32,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:32,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:32,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:32,126 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:24:32,127 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:24:32,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:24:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:24:32,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:32,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:32,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:24:32,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:32,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870105540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:32,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:24:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199112869] [2025-03-03 14:24:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:24:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:32,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:24:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:32,436 INFO L87 Difference]: Start difference. First operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:32,492 INFO L93 Difference]: Finished difference Result 583 states and 844 transitions. [2025-03-03 14:24:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:24:32,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2025-03-03 14:24:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:32,506 INFO L225 Difference]: With dead ends: 583 [2025-03-03 14:24:32,506 INFO L226 Difference]: Without dead ends: 361 [2025-03-03 14:24:32,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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:24:32,512 INFO L435 NwaCegarLoop]: 541 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, 541 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:24:32,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-03 14:24:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-03 14:24:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 278 states have (on average 1.4964028776978417) internal successors, (416), 281 states have internal predecessors, (416), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:24:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2025-03-03 14:24:32,557 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 107 [2025-03-03 14:24:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:32,558 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2025-03-03 14:24:32,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2025-03-03 14:24:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:24:32,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:32,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:32,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:24:32,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1972937420, now seen corresponding path program 1 times [2025-03-03 14:24:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412188638] [2025-03-03 14:24:32,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:32,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:24:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:24:32,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:32,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:24:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412188638] [2025-03-03 14:24:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412188638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758525421] [2025-03-03 14:24:32,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:32,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:32,993 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:24:32,994 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:24:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:24:33,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:24:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:33,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:24:33,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:33,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758525421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178137861] [2025-03-03 14:24:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:33,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:33,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:33,291 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:33,331 INFO L93 Difference]: Finished difference Result 572 states and 825 transitions. [2025-03-03 14:24:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:33,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-03 14:24:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:33,336 INFO L225 Difference]: With dead ends: 572 [2025-03-03 14:24:33,337 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 14:24:33,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:33,339 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 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:24:33,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 14:24:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-03 14:24:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.4928571428571429) internal successors, (418), 283 states have internal predecessors, (418), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:24:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2025-03-03 14:24:33,366 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 108 [2025-03-03 14:24:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:33,367 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2025-03-03 14:24:33,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2025-03-03 14:24:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:24:33,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:33,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:33,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:24:33,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:24:33,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:33,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash 723998243, now seen corresponding path program 1 times [2025-03-03 14:24:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840033234] [2025-03-03 14:24:33,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:33,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:24:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:24:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840033234] [2025-03-03 14:24:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840033234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226863881] [2025-03-03 14:24:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:33,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:33,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:33,782 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:24:33,783 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:24:33,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:24:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:24:34,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:34,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:34,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:34,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226863881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259392959] [2025-03-03 14:24:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:34,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:34,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:34,062 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:34,118 INFO L93 Difference]: Finished difference Result 755 states and 1128 transitions. [2025-03-03 14:24:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-03-03 14:24:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:34,123 INFO L225 Difference]: With dead ends: 755 [2025-03-03 14:24:34,123 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 14:24:34,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:34,125 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 107 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1027 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:34,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1027 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:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 14:24:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2025-03-03 14:24:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 320 states have internal predecessors, (479), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:24:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2025-03-03 14:24:34,150 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 113 [2025-03-03 14:24:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2025-03-03 14:24:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2025-03-03 14:24:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:24:34,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:34,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:34,162 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:24:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:34,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1255236049, now seen corresponding path program 1 times [2025-03-03 14:24:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876915172] [2025-03-03 14:24:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:24:34,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:24:34,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:34,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876915172] [2025-03-03 14:24:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876915172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344745398] [2025-03-03 14:24:34,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:34,509 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:24:34,511 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:24:34,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:24:34,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:24:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:34,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:34,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:24:34,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:24:34,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344745398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916381] [2025-03-03 14:24:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:34,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:34,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:34,781 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:34,840 INFO L93 Difference]: Finished difference Result 813 states and 1226 transitions. [2025-03-03 14:24:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-03-03 14:24:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:34,843 INFO L225 Difference]: With dead ends: 813 [2025-03-03 14:24:34,843 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 14:24:34,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:34,845 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:34,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2089 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 14:24:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 14:24:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 318 states have (on average 1.509433962264151) internal successors, (480), 322 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-03-03 14:24:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2025-03-03 14:24:34,868 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 114 [2025-03-03 14:24:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:34,869 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2025-03-03 14:24:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2025-03-03 14:24:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:24:34,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:34,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:34,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:35,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:35,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -58337571, now seen corresponding path program 1 times [2025-03-03 14:24:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648107573] [2025-03-03 14:24:35,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:35,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:24:35,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:24:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:24:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648107573] [2025-03-03 14:24:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648107573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402574880] [2025-03-03 14:24:35,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:35,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:35,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:35,228 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:24:35,230 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:24:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:24:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:24:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:35,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:35,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:24:35,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402574880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:24:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388563284] [2025-03-03 14:24:35,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:35,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:35,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:35,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:35,511 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:35,576 INFO L93 Difference]: Finished difference Result 815 states and 1231 transitions. [2025-03-03 14:24:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-03 14:24:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:35,580 INFO L225 Difference]: With dead ends: 815 [2025-03-03 14:24:35,580 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 14:24:35,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:35,583 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:35,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2075 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 14:24:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-03 14:24:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-03-03 14:24:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2025-03-03 14:24:35,598 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 115 [2025-03-03 14:24:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:35,598 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2025-03-03 14:24:35,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2025-03-03 14:24:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:24:35,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:35,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:35,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:24:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:35,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -647549053, now seen corresponding path program 1 times [2025-03-03 14:24:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053348070] [2025-03-03 14:24:35,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:35,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:24:35,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:24:35,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053348070] [2025-03-03 14:24:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053348070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:35,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:35,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465059913] [2025-03-03 14:24:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:35,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:35,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:35,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:35,915 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:35,948 INFO L93 Difference]: Finished difference Result 807 states and 1222 transitions. [2025-03-03 14:24:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-03 14:24:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:35,951 INFO L225 Difference]: With dead ends: 807 [2025-03-03 14:24:35,952 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 14:24:35,953 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:24:35,953 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:35,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 14:24:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-03 14:24:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-03-03 14:24:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2025-03-03 14:24:35,969 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 116 [2025-03-03 14:24:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:35,969 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2025-03-03 14:24:35,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2025-03-03 14:24:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:24:35,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:35,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:24:35,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:35,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2146692307, now seen corresponding path program 2 times [2025-03-03 14:24:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606055932] [2025-03-03 14:24:35,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:35,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-03 14:24:35,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 117 statements. [2025-03-03 14:24:35,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:35,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606055932] [2025-03-03 14:24:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606055932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:36,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:36,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429197222] [2025-03-03 14:24:36,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:36,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:36,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:36,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:36,099 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:36,458 INFO L93 Difference]: Finished difference Result 839 states and 1276 transitions. [2025-03-03 14:24:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:24:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-03 14:24:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:36,464 INFO L225 Difference]: With dead ends: 839 [2025-03-03 14:24:36,465 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 14:24:36,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:24:36,466 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 888 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:36,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 3111 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:24:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 14:24:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 825. [2025-03-03 14:24:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 636 states have (on average 1.5125786163522013) internal successors, (962), 643 states have internal predecessors, (962), 138 states have call successors, (138), 47 states have call predecessors, (138), 50 states have return successors, (153), 138 states have call predecessors, (153), 136 states have call successors, (153) [2025-03-03 14:24:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1253 transitions. [2025-03-03 14:24:36,515 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1253 transitions. Word has length 117 [2025-03-03 14:24:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:36,516 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1253 transitions. [2025-03-03 14:24:36,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1253 transitions. [2025-03-03 14:24:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:24:36,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:36,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:36,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:24:36,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1777377102, now seen corresponding path program 1 times [2025-03-03 14:24:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:36,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443724354] [2025-03-03 14:24:36,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:36,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:36,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:36,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443724354] [2025-03-03 14:24:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443724354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291376672] [2025-03-03 14:24:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:36,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:36,639 INFO L87 Difference]: Start difference. First operand 825 states and 1253 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:36,690 INFO L93 Difference]: Finished difference Result 1619 states and 2466 transitions. [2025-03-03 14:24:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-03 14:24:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:36,696 INFO L225 Difference]: With dead ends: 1619 [2025-03-03 14:24:36,696 INFO L226 Difference]: Without dead ends: 829 [2025-03-03 14:24:36,699 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:24:36,699 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:36,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2096 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-03 14:24:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2025-03-03 14:24:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 638 states have (on average 1.5109717868338557) internal successors, (964), 647 states have internal predecessors, (964), 138 states have call successors, (138), 47 states have call predecessors, (138), 52 states have return successors, (156), 138 states have call predecessors, (156), 136 states have call successors, (156) [2025-03-03 14:24:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1258 transitions. [2025-03-03 14:24:36,739 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1258 transitions. Word has length 118 [2025-03-03 14:24:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:36,740 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1258 transitions. [2025-03-03 14:24:36,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:24:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1258 transitions. [2025-03-03 14:24:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:24:36,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:36,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:24:36,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 308829563, now seen corresponding path program 1 times [2025-03-03 14:24:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969773606] [2025-03-03 14:24:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:36,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:24:36,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:24:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:24:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969773606] [2025-03-03 14:24:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969773606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:36,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919851238] [2025-03-03 14:24:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:36,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:36,867 INFO L87 Difference]: Start difference. First operand 829 states and 1258 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:24:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:36,989 INFO L93 Difference]: Finished difference Result 1617 states and 2458 transitions. [2025-03-03 14:24:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:24:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-03-03 14:24:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:36,994 INFO L225 Difference]: With dead ends: 1617 [2025-03-03 14:24:36,994 INFO L226 Difference]: Without dead ends: 833 [2025-03-03 14:24:36,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:24:36,997 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 7 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:36,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3590 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-03 14:24:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 831. [2025-03-03 14:24:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 640 states have (on average 1.509375) internal successors, (966), 648 states have internal predecessors, (966), 138 states have call successors, (138), 48 states have call predecessors, (138), 52 states have return successors, (154), 138 states have call predecessors, (154), 136 states have call successors, (154) [2025-03-03 14:24:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1258 transitions. [2025-03-03 14:24:37,057 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1258 transitions. Word has length 119 [2025-03-03 14:24:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1258 transitions. [2025-03-03 14:24:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:24:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1258 transitions. [2025-03-03 14:24:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:24:37,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:37,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:37,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:24:37,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:37,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1119340349, now seen corresponding path program 2 times [2025-03-03 14:24:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292530397] [2025-03-03 14:24:37,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:37,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-03 14:24:37,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 120 statements. [2025-03-03 14:24:37,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:37,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292530397] [2025-03-03 14:24:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292530397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359875277] [2025-03-03 14:24:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:37,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:37,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:37,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:37,153 INFO L87 Difference]: Start difference. First operand 831 states and 1258 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:37,523 INFO L93 Difference]: Finished difference Result 1659 states and 2540 transitions. [2025-03-03 14:24:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:24:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-03-03 14:24:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:37,532 INFO L225 Difference]: With dead ends: 1659 [2025-03-03 14:24:37,533 INFO L226 Difference]: Without dead ends: 1657 [2025-03-03 14:24:37,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:24:37,535 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 481 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:37,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3514 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:24:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-03 14:24:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1633. [2025-03-03 14:24:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1261 states have (on average 1.5154639175257731) internal successors, (1911), 1278 states have internal predecessors, (1911), 266 states have call successors, (266), 94 states have call predecessors, (266), 105 states have return successors, (321), 268 states have call predecessors, (321), 262 states have call successors, (321) [2025-03-03 14:24:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2498 transitions. [2025-03-03 14:24:37,615 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2498 transitions. Word has length 120 [2025-03-03 14:24:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:37,615 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2498 transitions. [2025-03-03 14:24:37,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2498 transitions. [2025-03-03 14:24:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:24:37,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:37,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:37,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:24:37,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:37,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1578585766, now seen corresponding path program 1 times [2025-03-03 14:24:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585665813] [2025-03-03 14:24:37,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:37,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:24:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:24:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:37,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585665813] [2025-03-03 14:24:37,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585665813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:37,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665216553] [2025-03-03 14:24:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:37,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:37,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:37,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:37,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:24:37,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:24:37,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:24:37,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:37,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:37,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:37,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:24:38,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665216553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654862894] [2025-03-03 14:24:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:38,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:38,015 INFO L87 Difference]: Start difference. First operand 1633 states and 2498 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:38,086 INFO L93 Difference]: Finished difference Result 2467 states and 3765 transitions. [2025-03-03 14:24:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-03-03 14:24:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:38,096 INFO L225 Difference]: With dead ends: 2467 [2025-03-03 14:24:38,096 INFO L226 Difference]: Without dead ends: 1647 [2025-03-03 14:24:38,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:38,100 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2086 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-03 14:24:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1635. [2025-03-03 14:24:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1262 states have (on average 1.515055467511886) internal successors, (1912), 1280 states have internal predecessors, (1912), 266 states have call successors, (266), 94 states have call predecessors, (266), 106 states have return successors, (323), 268 states have call predecessors, (323), 262 states have call successors, (323) [2025-03-03 14:24:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2501 transitions. [2025-03-03 14:24:38,159 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2501 transitions. Word has length 120 [2025-03-03 14:24:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2501 transitions. [2025-03-03 14:24:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2501 transitions. [2025-03-03 14:24:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:24:38,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:38,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:38,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:38,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1772574726, now seen corresponding path program 1 times [2025-03-03 14:24:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178031353] [2025-03-03 14:24:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:38,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:38,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:38,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:24:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178031353] [2025-03-03 14:24:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178031353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496173098] [2025-03-03 14:24:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:38,491 INFO L87 Difference]: Start difference. First operand 1635 states and 2501 transitions. Second operand has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:24:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:38,617 INFO L93 Difference]: Finished difference Result 2429 states and 3710 transitions. [2025-03-03 14:24:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:24:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2025-03-03 14:24:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:38,622 INFO L225 Difference]: With dead ends: 2429 [2025-03-03 14:24:38,622 INFO L226 Difference]: Without dead ends: 843 [2025-03-03 14:24:38,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:24:38,626 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 5 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:38,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3604 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-03 14:24:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 841. [2025-03-03 14:24:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 647 states have (on average 1.5038639876352395) internal successors, (973), 657 states have internal predecessors, (973), 138 states have call successors, (138), 49 states have call predecessors, (138), 55 states have return successors, (163), 138 states have call predecessors, (163), 136 states have call successors, (163) [2025-03-03 14:24:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1274 transitions. [2025-03-03 14:24:38,652 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1274 transitions. Word has length 121 [2025-03-03 14:24:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:38,652 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1274 transitions. [2025-03-03 14:24:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:24:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1274 transitions. [2025-03-03 14:24:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:24:38,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:38,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:24:38,655 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash -350129922, now seen corresponding path program 1 times [2025-03-03 14:24:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226593381] [2025-03-03 14:24:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:38,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226593381] [2025-03-03 14:24:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226593381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795234723] [2025-03-03 14:24:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:38,757 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:38,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:24:38,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:38,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:38,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:38,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:38,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:38,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:39,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:24:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795234723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:24:39,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:24:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:24:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304559653] [2025-03-03 14:24:39,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:24:39,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:24:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:39,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:24:39,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:24:39,089 INFO L87 Difference]: Start difference. First operand 841 states and 1274 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:24:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:39,209 INFO L93 Difference]: Finished difference Result 1955 states and 3070 transitions. [2025-03-03 14:24:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:24:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2025-03-03 14:24:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:39,218 INFO L225 Difference]: With dead ends: 1955 [2025-03-03 14:24:39,218 INFO L226 Difference]: Without dead ends: 1535 [2025-03-03 14:24:39,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 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:24:39,221 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 315 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:39,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2766 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-03 14:24:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1487. [2025-03-03 14:24:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1165 states have (on average 1.578540772532189) internal successors, (1839), 1175 states have internal predecessors, (1839), 266 states have call successors, (266), 49 states have call predecessors, (266), 55 states have return successors, (316), 266 states have call predecessors, (316), 264 states have call successors, (316) [2025-03-03 14:24:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2421 transitions. [2025-03-03 14:24:39,273 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2421 transitions. Word has length 121 [2025-03-03 14:24:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:39,273 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2421 transitions. [2025-03-03 14:24:39,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:24:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2421 transitions. [2025-03-03 14:24:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:24:39,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:39,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:39,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:24:39,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:39,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1894485026, now seen corresponding path program 1 times [2025-03-03 14:24:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-03-03 14:24:39,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:39,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:24:39,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:24:39,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:39,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809575192] [2025-03-03 14:24:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809575192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070107508] [2025-03-03 14:24:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:39,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:39,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:39,533 INFO L87 Difference]: Start difference. First operand 1487 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:39,574 INFO L93 Difference]: Finished difference Result 3503 states and 5795 transitions. [2025-03-03 14:24:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2025-03-03 14:24:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:39,585 INFO L225 Difference]: With dead ends: 3503 [2025-03-03 14:24:39,585 INFO L226 Difference]: Without dead ends: 2143 [2025-03-03 14:24:39,589 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:39,590 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 105 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1077 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:39,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1077 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:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2025-03-03 14:24:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2127. [2025-03-03 14:24:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1677 states have (on average 1.5974955277280858) internal successors, (2679), 1687 states have internal predecessors, (2679), 394 states have call successors, (394), 49 states have call predecessors, (394), 55 states have return successors, (469), 394 states have call predecessors, (469), 392 states have call successors, (469) [2025-03-03 14:24:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3542 transitions. [2025-03-03 14:24:39,669 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3542 transitions. Word has length 127 [2025-03-03 14:24:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:39,669 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 3542 transitions. [2025-03-03 14:24:39,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3542 transitions. [2025-03-03 14:24:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:24:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:39,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:39,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:24:39,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:39,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1932447333, now seen corresponding path program 1 times [2025-03-03 14:24:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861439997] [2025-03-03 14:24:39,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:24:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:24:39,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:39,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861439997] [2025-03-03 14:24:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861439997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144576772] [2025-03-03 14:24:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:39,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:39,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:39,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:39,730 INFO L87 Difference]: Start difference. First operand 2127 states and 3542 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:39,795 INFO L93 Difference]: Finished difference Result 5041 states and 8464 transitions. [2025-03-03 14:24:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-03 14:24:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:39,812 INFO L225 Difference]: With dead ends: 5041 [2025-03-03 14:24:39,812 INFO L226 Difference]: Without dead ends: 3143 [2025-03-03 14:24:39,821 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:39,821 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 103 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1068 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:39,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1068 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:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-03-03 14:24:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3127. [2025-03-03 14:24:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2487 states have (on average 1.6103739445114595) internal successors, (4005), 2497 states have internal predecessors, (4005), 584 states have call successors, (584), 49 states have call predecessors, (584), 55 states have return successors, (675), 584 states have call predecessors, (675), 582 states have call successors, (675) [2025-03-03 14:24:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 5264 transitions. [2025-03-03 14:24:39,934 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 5264 transitions. Word has length 128 [2025-03-03 14:24:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:39,934 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 5264 transitions. [2025-03-03 14:24:39,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 5264 transitions. [2025-03-03 14:24:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:24:39,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:39,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:39,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:24:39,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash 590647869, now seen corresponding path program 1 times [2025-03-03 14:24:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209433724] [2025-03-03 14:24:39,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:24:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:24:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209433724] [2025-03-03 14:24:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209433724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864759288] [2025-03-03 14:24:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:39,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:39,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:39,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:39,990 INFO L87 Difference]: Start difference. First operand 3127 states and 5264 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:40,115 INFO L93 Difference]: Finished difference Result 7309 states and 12412 transitions. [2025-03-03 14:24:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-03 14:24:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:40,139 INFO L225 Difference]: With dead ends: 7309 [2025-03-03 14:24:40,139 INFO L226 Difference]: Without dead ends: 4655 [2025-03-03 14:24:40,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:40,149 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 101 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1055 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:40,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1055 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:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-03-03 14:24:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4639. [2025-03-03 14:24:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 3753 states have (on average 1.6203037569944045) internal successors, (6081), 3763 states have internal predecessors, (6081), 830 states have call successors, (830), 49 states have call predecessors, (830), 55 states have return successors, (971), 830 states have call predecessors, (971), 828 states have call successors, (971) [2025-03-03 14:24:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 7882 transitions. [2025-03-03 14:24:40,300 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 7882 transitions. Word has length 129 [2025-03-03 14:24:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 4639 states and 7882 transitions. [2025-03-03 14:24:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7882 transitions. [2025-03-03 14:24:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:24:40,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:40,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:40,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:24:40,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 325386662, now seen corresponding path program 1 times [2025-03-03 14:24:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038878645] [2025-03-03 14:24:40,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:40,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:24:40,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:24:40,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038878645] [2025-03-03 14:24:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038878645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101086461] [2025-03-03 14:24:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:40,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:40,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:40,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:40,359 INFO L87 Difference]: Start difference. First operand 4639 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:40,514 INFO L93 Difference]: Finished difference Result 10835 states and 18556 transitions. [2025-03-03 14:24:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:40,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-03 14:24:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:40,588 INFO L225 Difference]: With dead ends: 10835 [2025-03-03 14:24:40,588 INFO L226 Difference]: Without dead ends: 7069 [2025-03-03 14:24:40,604 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:40,605 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 99 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1055 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:40,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1055 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:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7069 states. [2025-03-03 14:24:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7069 to 7053. [2025-03-03 14:24:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7053 states, 5809 states have (on average 1.6269581683594423) internal successors, (9451), 5819 states have internal predecessors, (9451), 1188 states have call successors, (1188), 49 states have call predecessors, (1188), 55 states have return successors, (1412), 1188 states have call predecessors, (1412), 1186 states have call successors, (1412) [2025-03-03 14:24:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 12051 transitions. [2025-03-03 14:24:40,922 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 12051 transitions. Word has length 130 [2025-03-03 14:24:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:40,922 INFO L471 AbstractCegarLoop]: Abstraction has 7053 states and 12051 transitions. [2025-03-03 14:24:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 12051 transitions. [2025-03-03 14:24:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:24:40,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:40,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:40,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:24:40,950 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1235615300, now seen corresponding path program 1 times [2025-03-03 14:24:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35812614] [2025-03-03 14:24:40,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:40,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:24:40,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:24:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35812614] [2025-03-03 14:24:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35812614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521435165] [2025-03-03 14:24:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:41,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:41,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:41,014 INFO L87 Difference]: Start difference. First operand 7053 states and 12051 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:41,273 INFO L93 Difference]: Finished difference Result 16619 states and 28629 transitions. [2025-03-03 14:24:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:41,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-03 14:24:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:41,320 INFO L225 Difference]: With dead ends: 16619 [2025-03-03 14:24:41,321 INFO L226 Difference]: Without dead ends: 11053 [2025-03-03 14:24:41,342 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:41,343 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 97 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1066 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:41,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1066 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:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2025-03-03 14:24:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 11037. [2025-03-03 14:24:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11037 states, 9041 states have (on average 1.6233823692069462) internal successors, (14677), 9051 states have internal predecessors, (14677), 1940 states have call successors, (1940), 49 states have call predecessors, (1940), 55 states have return successors, (2308), 1940 states have call predecessors, (2308), 1938 states have call successors, (2308) [2025-03-03 14:24:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11037 states to 11037 states and 18925 transitions. [2025-03-03 14:24:41,741 INFO L78 Accepts]: Start accepts. Automaton has 11037 states and 18925 transitions. Word has length 131 [2025-03-03 14:24:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 11037 states and 18925 transitions. [2025-03-03 14:24:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11037 states and 18925 transitions. [2025-03-03 14:24:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:24:41,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:41,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:24:41,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -948770073, now seen corresponding path program 1 times [2025-03-03 14:24:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411877815] [2025-03-03 14:24:41,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:24:41,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:24:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411877815] [2025-03-03 14:24:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411877815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413058677] [2025-03-03 14:24:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:41,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:41,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:41,824 INFO L87 Difference]: Start difference. First operand 11037 states and 18925 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:42,123 INFO L93 Difference]: Finished difference Result 27083 states and 46711 transitions. [2025-03-03 14:24:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-03 14:24:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:42,198 INFO L225 Difference]: With dead ends: 27083 [2025-03-03 14:24:42,198 INFO L226 Difference]: Without dead ends: 18275 [2025-03-03 14:24:42,228 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:42,228 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 95 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1068 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:42,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1068 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:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18275 states. [2025-03-03 14:24:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18275 to 18259. [2025-03-03 14:24:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18259 states, 15051 states have (on average 1.6228157597501827) internal successors, (24425), 15061 states have internal predecessors, (24425), 3152 states have call successors, (3152), 49 states have call predecessors, (3152), 55 states have return successors, (3709), 3152 states have call predecessors, (3709), 3150 states have call successors, (3709) [2025-03-03 14:24:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18259 states to 18259 states and 31286 transitions. [2025-03-03 14:24:42,936 INFO L78 Accepts]: Start accepts. Automaton has 18259 states and 31286 transitions. Word has length 132 [2025-03-03 14:24:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 18259 states and 31286 transitions. [2025-03-03 14:24:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 18259 states and 31286 transitions. [2025-03-03 14:24:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:24:42,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:42,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:24:42,978 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 775701339, now seen corresponding path program 1 times [2025-03-03 14:24:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699817149] [2025-03-03 14:24:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:42,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:24:43,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:24:43,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:43,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699817149] [2025-03-03 14:24:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699817149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:43,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029220849] [2025-03-03 14:24:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:43,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:43,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:43,033 INFO L87 Difference]: Start difference. First operand 18259 states and 31286 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:43,834 INFO L93 Difference]: Finished difference Result 47047 states and 81013 transitions. [2025-03-03 14:24:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-03 14:24:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:43,994 INFO L225 Difference]: With dead ends: 47047 [2025-03-03 14:24:43,994 INFO L226 Difference]: Without dead ends: 31907 [2025-03-03 14:24:44,165 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:44,166 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 93 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1085 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:44,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1085 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:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31907 states. [2025-03-03 14:24:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31907 to 31891. [2025-03-03 14:24:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31891 states, 26277 states have (on average 1.6149103778970202) internal successors, (42435), 26287 states have internal predecessors, (42435), 5558 states have call successors, (5558), 49 states have call predecessors, (5558), 55 states have return successors, (6540), 5558 states have call predecessors, (6540), 5556 states have call successors, (6540) [2025-03-03 14:24:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31891 states to 31891 states and 54533 transitions. [2025-03-03 14:24:45,211 INFO L78 Accepts]: Start accepts. Automaton has 31891 states and 54533 transitions. Word has length 133 [2025-03-03 14:24:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 31891 states and 54533 transitions. [2025-03-03 14:24:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 31891 states and 54533 transitions. [2025-03-03 14:24:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:24:45,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:45,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:45,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:24:45,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2115824728, now seen corresponding path program 1 times [2025-03-03 14:24:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711905907] [2025-03-03 14:24:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:24:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:24:45,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711905907] [2025-03-03 14:24:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711905907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:45,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447282794] [2025-03-03 14:24:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:45,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:45,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:45,319 INFO L87 Difference]: Start difference. First operand 31891 states and 54533 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:46,473 INFO L93 Difference]: Finished difference Result 84189 states and 144744 transitions. [2025-03-03 14:24:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-03 14:24:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:46,737 INFO L225 Difference]: With dead ends: 84189 [2025-03-03 14:24:46,737 INFO L226 Difference]: Without dead ends: 56685 [2025-03-03 14:24:46,817 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:46,818 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 91 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1058 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:46,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1058 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:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56685 states. [2025-03-03 14:24:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56685 to 56669. [2025-03-03 14:24:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56669 states, 46977 states have (on average 1.6116610256082764) internal successors, (75711), 46987 states have internal predecessors, (75711), 9636 states have call successors, (9636), 49 states have call predecessors, (9636), 55 states have return successors, (11432), 9636 states have call predecessors, (11432), 9634 states have call successors, (11432) [2025-03-03 14:24:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56669 states to 56669 states and 96779 transitions. [2025-03-03 14:24:49,061 INFO L78 Accepts]: Start accepts. Automaton has 56669 states and 96779 transitions. Word has length 134 [2025-03-03 14:24:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:49,062 INFO L471 AbstractCegarLoop]: Abstraction has 56669 states and 96779 transitions. [2025-03-03 14:24:49,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 56669 states and 96779 transitions. [2025-03-03 14:24:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:24:49,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:49,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:24:49,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 371389466, now seen corresponding path program 1 times [2025-03-03 14:24:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423739538] [2025-03-03 14:24:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:49,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:24:49,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:24:49,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423739538] [2025-03-03 14:24:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423739538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:49,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798966375] [2025-03-03 14:24:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:49,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:49,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:49,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:49,189 INFO L87 Difference]: Start difference. First operand 56669 states and 96779 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:51,684 INFO L93 Difference]: Finished difference Result 154153 states and 263858 transitions. [2025-03-03 14:24:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-03 14:24:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:52,153 INFO L225 Difference]: With dead ends: 154153 [2025-03-03 14:24:52,153 INFO L226 Difference]: Without dead ends: 103397 [2025-03-03 14:24:52,291 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:52,293 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 89 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1059 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:52,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1059 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:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103397 states. [2025-03-03 14:24:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103397 to 103381. [2025-03-03 14:24:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103381 states, 86259 states have (on average 1.6068236357945258) internal successors, (138603), 86269 states have internal predecessors, (138603), 17066 states have call successors, (17066), 49 states have call predecessors, (17066), 55 states have return successors, (19926), 17066 states have call predecessors, (19926), 17064 states have call successors, (19926) [2025-03-03 14:24:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103381 states to 103381 states and 175595 transitions. [2025-03-03 14:24:56,004 INFO L78 Accepts]: Start accepts. Automaton has 103381 states and 175595 transitions. Word has length 135 [2025-03-03 14:24:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 103381 states and 175595 transitions. [2025-03-03 14:24:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 103381 states and 175595 transitions. [2025-03-03 14:24:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:24:56,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:56,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:24:56,119 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 626880777, now seen corresponding path program 1 times [2025-03-03 14:24:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:56,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736317984] [2025-03-03 14:24:56,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:56,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:24:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:24:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736317984] [2025-03-03 14:24:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736317984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745713199] [2025-03-03 14:24:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:56,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:56,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:56,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:56,177 INFO L87 Difference]: Start difference. First operand 103381 states and 175595 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:24:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:59,625 INFO L93 Difference]: Finished difference Result 192669 states and 328065 transitions. [2025-03-03 14:24:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-03 14:24:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:00,466 INFO L225 Difference]: With dead ends: 192669 [2025-03-03 14:25:00,466 INFO L226 Difference]: Without dead ends: 192249 [2025-03-03 14:25:00,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:00,562 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 84 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1072 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:25:00,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192249 states. [2025-03-03 14:25:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192249 to 192233. [2025-03-03 14:25:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192233 states, 161513 states have (on average 1.6003479596069665) internal successors, (258477), 161523 states have internal predecessors, (258477), 30664 states have call successors, (30664), 49 states have call predecessors, (30664), 55 states have return successors, (36139), 30664 states have call predecessors, (36139), 30662 states have call successors, (36139) [2025-03-03 14:25:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192233 states to 192233 states and 325280 transitions. [2025-03-03 14:25:07,199 INFO L78 Accepts]: Start accepts. Automaton has 192233 states and 325280 transitions. Word has length 136 [2025-03-03 14:25:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:07,201 INFO L471 AbstractCegarLoop]: Abstraction has 192233 states and 325280 transitions. [2025-03-03 14:25:07,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:25:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 192233 states and 325280 transitions. [2025-03-03 14:25:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:25:07,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:07,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:25:07,336 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1253163879, now seen corresponding path program 1 times [2025-03-03 14:25:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626085843] [2025-03-03 14:25:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:07,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:25:07,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:25:07,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626085843] [2025-03-03 14:25:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626085843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:25:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942515374] [2025-03-03 14:25:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:25:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:07,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:25:07,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:25:07,597 INFO L87 Difference]: Start difference. First operand 192233 states and 325280 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)