./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product13.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 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:31:53,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:31:53,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:31:53,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:31:53,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:31:53,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:31:53,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:31:53,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:31:53,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:31:53,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:31:53,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:31:53,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:31:53,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:31:53,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:31:53,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:31:53,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:31:53,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:53,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:31:53,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:31:53,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:31:53,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:31:53,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:31:53,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:31:53,964 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 -> 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 [2025-03-08 05:31:54,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:31:54,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:31:54,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:31:54,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:31:54,203 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:31:54,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2025-03-08 05:31:55,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c433384/61d23925d5594e8d8a22823cfeb3a804/FLAG2f5dbf59d [2025-03-08 05:31:55,743 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:31:55,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2025-03-08 05:31:55,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c433384/61d23925d5594e8d8a22823cfeb3a804/FLAG2f5dbf59d [2025-03-08 05:31:55,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c433384/61d23925d5594e8d8a22823cfeb3a804 [2025-03-08 05:31:55,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:31:55,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:31:55,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:55,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:31:55,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:31:55,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:55" (1/1) ... [2025-03-08 05:31:55,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd3f20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:55, skipping insertion in model container [2025-03-08 05:31:55,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:55" (1/1) ... [2025-03-08 05:31:55,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:31:56,292 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_spec27_product13.cil.c[61687,61700] [2025-03-08 05:31:56,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:56,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:31:56,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-08 05:31:56,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2025-03-08 05:31:56,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2025-03-08 05:31:56,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [481] [2025-03-08 05:31:56,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [588] [2025-03-08 05:31:56,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [855] [2025-03-08 05:31:56,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1930] [2025-03-08 05:31:56,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2204] [2025-03-08 05:31:56,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2236] [2025-03-08 05:31:56,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2637] [2025-03-08 05:31:56,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2850] [2025-03-08 05:31:56,397 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_spec27_product13.cil.c[61687,61700] [2025-03-08 05:31:56,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:56,423 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:31:56,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56 WrapperNode [2025-03-08 05:31:56,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:56,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:56,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:31:56,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:31:56,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,477 INFO L138 Inliner]: procedures = 124, calls = 178, calls flagged for inlining = 52, calls inlined = 44, statements flattened = 822 [2025-03-08 05:31:56,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:56,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:31:56,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:31:56,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:31:56,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,517 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:31:56,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:31:56,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:31:56,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:31:56,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:31:56,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (1/1) ... [2025-03-08 05:31:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:56,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:31:56,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:31:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:31:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:31:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:31:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:31:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:31:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:31:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:31:56,596 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:31:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:31:56,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:31:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:31:56,596 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:31:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:31:56,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:31:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:31:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:31:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:31:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:31:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:31:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:31:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:31:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:31:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:31:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:31:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:31:56,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:31:56,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:31:56,768 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: #res := ~retValue_acc~41; [2025-03-08 05:31:56,934 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1472-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~23#1; [2025-03-08 05:31:56,937 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-1: getClientId_#res#1 := getClientId_~retValue_acc~30#1; [2025-03-08 05:31:56,937 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L773-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~13#1; [2025-03-08 05:31:56,945 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544: #res := ~retValue_acc~40; [2025-03-08 05:31:56,968 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: #res := ~retValue_acc~42; [2025-03-08 05:31:56,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355: #res := ~retValue_acc~35; [2025-03-08 05:31:57,002 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1564: #res#1 := ~retValue_acc~25#1; [2025-03-08 05:31:57,002 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1519-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~24#1; [2025-03-08 05:31:57,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: #res := ~retValue_acc~28; [2025-03-08 05:31:57,057 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L585-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~10#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~11#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~12#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L478-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1734-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~27#1; [2025-03-08 05:31:57,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~26#1; [2025-03-08 05:31:57,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2318: #res := ~retValue_acc~34; [2025-03-08 05:31:57,290 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: #res := ~retValue_acc~6; [2025-03-08 05:31:57,386 INFO L? ?]: Removed 368 outVars from TransFormulas that were not future-live. [2025-03-08 05:31:57,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:31:57,400 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:31:57,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:31:57,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:57 BoogieIcfgContainer [2025-03-08 05:31:57,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:31:57,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:31:57,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:31:57,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:31:57,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:55" (1/3) ... [2025-03-08 05:31:57,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5933805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:57, skipping insertion in model container [2025-03-08 05:31:57,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:56" (2/3) ... [2025-03-08 05:31:57,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5933805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:57, skipping insertion in model container [2025-03-08 05:31:57,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:57" (3/3) ... [2025-03-08 05:31:57,412 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product13.cil.c [2025-03-08 05:31:57,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:31:57,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product13.cil.c that has 18 procedures, 276 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:31:57,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:31:57,494 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;@713e1e79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:31:57,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:31:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 276 states, 219 states have (on average 1.547945205479452) internal successors, (339), 221 states have internal predecessors, (339), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 05:31:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:31:57,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:57,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:57,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937480, now seen corresponding path program 1 times [2025-03-08 05:31:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315816638] [2025-03-08 05:31:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:57,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:31:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:31:57,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:57,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:31:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315816638] [2025-03-08 05:31:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315816638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451545656] [2025-03-08 05:31:58,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:58,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:58,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:31:58,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:31:58,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:31:58,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:58,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:31:58,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:58,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451545656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333208388] [2025-03-08 05:31:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:58,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:58,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:58,403 INFO L87 Difference]: Start difference. First operand has 276 states, 219 states have (on average 1.547945205479452) internal successors, (339), 221 states have internal predecessors, (339), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:31:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:58,452 INFO L93 Difference]: Finished difference Result 406 states and 598 transitions. [2025-03-08 05:31:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:58,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2025-03-08 05:31:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:58,462 INFO L225 Difference]: With dead ends: 406 [2025-03-08 05:31:58,462 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 05:31:58,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:58,466 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:58,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 819 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 05:31:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-08 05:31:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.5420560747663552) internal successors, (330), 215 states have internal predecessors, (330), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:31:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 405 transitions. [2025-03-08 05:31:58,505 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 405 transitions. Word has length 105 [2025-03-08 05:31:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:58,506 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 405 transitions. [2025-03-08 05:31:58,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:31:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 405 transitions. [2025-03-08 05:31:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:31:58,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:58,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:58,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:31:58,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:31:58,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:58,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 120017664, now seen corresponding path program 1 times [2025-03-08 05:31:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:58,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40525683] [2025-03-08 05:31:58,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:58,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:58,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:58,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:58,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40525683] [2025-03-08 05:31:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40525683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622642241] [2025-03-08 05:31:58,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:58,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:58,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:58,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:31:59,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:59,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:59,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:59,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:59,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:59,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:59,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622642241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:59,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244466207] [2025-03-08 05:31:59,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:59,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:59,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:59,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:59,255 INFO L87 Difference]: Start difference. First operand 270 states and 405 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:31:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:59,298 INFO L93 Difference]: Finished difference Result 564 states and 860 transitions. [2025-03-08 05:31:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-08 05:31:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:59,301 INFO L225 Difference]: With dead ends: 564 [2025-03-08 05:31:59,301 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 05:31:59,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:59,303 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 99 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:59,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 770 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 05:31:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2025-03-08 05:31:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 49 states have call successors, (49), 17 states have call predecessors, (49), 17 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 05:31:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 479 transitions. [2025-03-08 05:31:59,332 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 479 transitions. Word has length 109 [2025-03-08 05:31:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:59,332 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 479 transitions. [2025-03-08 05:31:59,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:31:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 479 transitions. [2025-03-08 05:31:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:31:59,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:59,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:59,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:31:59,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:31:59,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:59,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2081411066, now seen corresponding path program 1 times [2025-03-08 05:31:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990967845] [2025-03-08 05:31:59,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:31:59,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:31:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990967845] [2025-03-08 05:31:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990967845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270887548] [2025-03-08 05:31:59,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:59,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:59,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:31:59,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:31:59,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:31:59,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:59,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:31:59,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:00,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270887548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759722295] [2025-03-08 05:32:00,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:00,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:00,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:00,035 INFO L87 Difference]: Start difference. First operand 312 states and 479 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:00,093 INFO L93 Difference]: Finished difference Result 615 states and 948 transitions. [2025-03-08 05:32:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-08 05:32:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:00,098 INFO L225 Difference]: With dead ends: 615 [2025-03-08 05:32:00,100 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 05:32:00,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:00,102 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 2 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:00,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 05:32:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-08 05:32:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.556910569105691) internal successors, (383), 248 states have internal predecessors, (383), 49 states have call successors, (49), 17 states have call predecessors, (49), 18 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2025-03-08 05:32:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 482 transitions. [2025-03-08 05:32:00,129 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 482 transitions. Word has length 110 [2025-03-08 05:32:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:00,129 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 482 transitions. [2025-03-08 05:32:00,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2025-03-08 05:32:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:32:00,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:00,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:00,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:00,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:00,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:00,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1445195641, now seen corresponding path program 1 times [2025-03-08 05:32:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849438506] [2025-03-08 05:32:00,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:00,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:32:00,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:32:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849438506] [2025-03-08 05:32:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849438506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210288983] [2025-03-08 05:32:00,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:00,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:00,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:00,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:32:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:32:00,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:32:00,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:00,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:00,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:00,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:00,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210288983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146868183] [2025-03-08 05:32:00,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:00,773 INFO L87 Difference]: Start difference. First operand 314 states and 482 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:00,832 INFO L93 Difference]: Finished difference Result 617 states and 953 transitions. [2025-03-08 05:32:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-08 05:32:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:00,835 INFO L225 Difference]: With dead ends: 617 [2025-03-08 05:32:00,835 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 05:32:00,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:00,837 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:00,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1559 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 05:32:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-08 05:32:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.5546558704453441) internal successors, (384), 250 states have internal predecessors, (384), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2025-03-08 05:32:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 488 transitions. [2025-03-08 05:32:00,854 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 488 transitions. Word has length 111 [2025-03-08 05:32:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 488 transitions. [2025-03-08 05:32:00,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 488 transitions. [2025-03-08 05:32:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:32:00,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:00,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:00,878 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-08 05:32:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:01,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1002017132, now seen corresponding path program 1 times [2025-03-08 05:32:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454314110] [2025-03-08 05:32:01,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:32:01,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:32:01,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:01,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454314110] [2025-03-08 05:32:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454314110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085650450] [2025-03-08 05:32:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:01,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:01,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:01,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,200 INFO L87 Difference]: Start difference. First operand 316 states and 488 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:01,235 INFO L93 Difference]: Finished difference Result 609 states and 944 transitions. [2025-03-08 05:32:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:01,235 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-08 05:32:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:01,238 INFO L225 Difference]: With dead ends: 609 [2025-03-08 05:32:01,239 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 05:32:01,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,242 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:01,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1577 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 05:32:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-08 05:32:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.5546558704453441) internal successors, (384), 250 states have internal predecessors, (384), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2025-03-08 05:32:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 487 transitions. [2025-03-08 05:32:01,259 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 487 transitions. Word has length 112 [2025-03-08 05:32:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:01,259 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 487 transitions. [2025-03-08 05:32:01,259 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:32:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 487 transitions. [2025-03-08 05:32:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:32:01,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:01,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:01,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -89368091, now seen corresponding path program 2 times [2025-03-08 05:32:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983446485] [2025-03-08 05:32:01,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:01,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-08 05:32:01,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 113 statements. [2025-03-08 05:32:01,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:01,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983446485] [2025-03-08 05:32:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983446485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:32:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445635781] [2025-03-08 05:32:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:01,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:01,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:01,378 INFO L87 Difference]: Start difference. First operand 316 states and 487 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:32:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:01,412 INFO L93 Difference]: Finished difference Result 429 states and 643 transitions. [2025-03-08 05:32:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-03-08 05:32:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:01,414 INFO L225 Difference]: With dead ends: 429 [2025-03-08 05:32:01,415 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 05:32:01,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:01,416 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:01,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2385 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 05:32:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-08 05:32:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.5506072874493928) internal successors, (383), 250 states have internal predecessors, (383), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2025-03-08 05:32:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 486 transitions. [2025-03-08 05:32:01,437 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 486 transitions. Word has length 113 [2025-03-08 05:32:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 486 transitions. [2025-03-08 05:32:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:32:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 486 transitions. [2025-03-08 05:32:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:32:01,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:01,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:01,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:01,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:01,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 224203096, now seen corresponding path program 1 times [2025-03-08 05:32:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:01,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077892840] [2025-03-08 05:32:01,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:32:01,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:32:01,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:01,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077892840] [2025-03-08 05:32:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077892840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:01,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155246272] [2025-03-08 05:32:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:01,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:01,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,582 INFO L87 Difference]: Start difference. First operand 316 states and 486 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-08 05:32:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:01,624 INFO L93 Difference]: Finished difference Result 611 states and 945 transitions. [2025-03-08 05:32:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 120 [2025-03-08 05:32:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:01,628 INFO L225 Difference]: With dead ends: 611 [2025-03-08 05:32:01,628 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 05:32:01,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,630 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 1 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:01,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1576 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 05:32:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-08 05:32:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 248 states have (on average 1.5483870967741935) internal successors, (384), 252 states have internal predecessors, (384), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2025-03-08 05:32:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 489 transitions. [2025-03-08 05:32:01,648 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 489 transitions. Word has length 120 [2025-03-08 05:32:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:01,649 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 489 transitions. [2025-03-08 05:32:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-08 05:32:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 489 transitions. [2025-03-08 05:32:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:32:01,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:01,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:01,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1360694931, now seen corresponding path program 1 times [2025-03-08 05:32:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433985546] [2025-03-08 05:32:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:01,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:32:01,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:32:01,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:01,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433985546] [2025-03-08 05:32:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433985546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572083271] [2025-03-08 05:32:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:01,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:01,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:01,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,772 INFO L87 Difference]: Start difference. First operand 318 states and 489 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-08 05:32:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:01,813 INFO L93 Difference]: Finished difference Result 613 states and 948 transitions. [2025-03-08 05:32:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 121 [2025-03-08 05:32:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:01,816 INFO L225 Difference]: With dead ends: 613 [2025-03-08 05:32:01,816 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 05:32:01,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:01,817 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:01,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1569 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 05:32:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2025-03-08 05:32:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 248 states have (on average 1.5483870967741935) internal successors, (384), 252 states have internal predecessors, (384), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2025-03-08 05:32:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 489 transitions. [2025-03-08 05:32:01,841 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 489 transitions. Word has length 121 [2025-03-08 05:32:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 489 transitions. [2025-03-08 05:32:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-08 05:32:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 489 transitions. [2025-03-08 05:32:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:32:01,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:01,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:01,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:01,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash -151452692, now seen corresponding path program 1 times [2025-03-08 05:32:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:01,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81414285] [2025-03-08 05:32:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:01,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:32:01,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:32:01,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81414285] [2025-03-08 05:32:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81414285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:01,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:01,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82543505] [2025-03-08 05:32:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:01,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:01,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:01,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:01,994 INFO L87 Difference]: Start difference. First operand 318 states and 489 transitions. Second operand has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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-08 05:32:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:02,106 INFO L93 Difference]: Finished difference Result 613 states and 944 transitions. [2025-03-08 05:32:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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-08 05:32:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:02,109 INFO L225 Difference]: With dead ends: 613 [2025-03-08 05:32:02,109 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 05:32:02,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:02,110 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 7 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:02,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2680 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 05:32:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-08 05:32:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 250 states have (on average 1.544) internal successors, (386), 253 states have internal predecessors, (386), 49 states have call successors, (49), 18 states have call predecessors, (49), 20 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2025-03-08 05:32:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 490 transitions. [2025-03-08 05:32:02,123 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 490 transitions. Word has length 121 [2025-03-08 05:32:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:02,123 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 490 transitions. [2025-03-08 05:32:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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-08 05:32:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 490 transitions. [2025-03-08 05:32:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:32:02,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:02,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:02,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:32:02,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:02,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1199290901, now seen corresponding path program 2 times [2025-03-08 05:32:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403872376] [2025-03-08 05:32:02,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:02,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-08 05:32:02,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:32:02,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:32:02,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:32:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403872376] [2025-03-08 05:32:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403872376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:02,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:02,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91676008] [2025-03-08 05:32:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:02,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:02,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:02,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:02,264 INFO L87 Difference]: Start difference. First operand 320 states and 490 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:02,415 INFO L93 Difference]: Finished difference Result 552 states and 807 transitions. [2025-03-08 05:32:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:02,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2025-03-08 05:32:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:02,418 INFO L225 Difference]: With dead ends: 552 [2025-03-08 05:32:02,418 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 05:32:02,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:02,419 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 353 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1704 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 05:32:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2025-03-08 05:32:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 343 states have (on average 1.5160349854227406) internal successors, (520), 346 states have internal predecessors, (520), 60 states have call successors, (60), 27 states have call predecessors, (60), 31 states have return successors, (68), 61 states have call predecessors, (68), 58 states have call successors, (68) [2025-03-08 05:32:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 648 transitions. [2025-03-08 05:32:02,436 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 648 transitions. Word has length 122 [2025-03-08 05:32:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:02,436 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 648 transitions. [2025-03-08 05:32:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 648 transitions. [2025-03-08 05:32:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:32:02,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:02,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:32:02,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:02,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1356712840, now seen corresponding path program 1 times [2025-03-08 05:32:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455705205] [2025-03-08 05:32:02,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:02,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:32:02,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:32:02,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:02,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455705205] [2025-03-08 05:32:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455705205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:02,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:02,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958221436] [2025-03-08 05:32:02,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:02,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:02,557 INFO L87 Difference]: Start difference. First operand 435 states and 648 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 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-08 05:32:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:02,677 INFO L93 Difference]: Finished difference Result 848 states and 1270 transitions. [2025-03-08 05:32:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 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 123 [2025-03-08 05:32:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:02,680 INFO L225 Difference]: With dead ends: 848 [2025-03-08 05:32:02,680 INFO L226 Difference]: Without dead ends: 440 [2025-03-08 05:32:02,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:02,682 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 5 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:02,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2694 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-08 05:32:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2025-03-08 05:32:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 345 states have (on average 1.5130434782608695) internal successors, (522), 349 states have internal predecessors, (522), 60 states have call successors, (60), 27 states have call predecessors, (60), 32 states have return successors, (73), 61 states have call predecessors, (73), 58 states have call successors, (73) [2025-03-08 05:32:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 655 transitions. [2025-03-08 05:32:02,698 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 655 transitions. Word has length 123 [2025-03-08 05:32:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:02,698 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 655 transitions. [2025-03-08 05:32:02,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 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-08 05:32:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 655 transitions. [2025-03-08 05:32:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:32:02,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:02,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:32:02,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -106871900, now seen corresponding path program 1 times [2025-03-08 05:32:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945689906] [2025-03-08 05:32:02,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:02,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:32:02,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:32:02,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:02,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945689906] [2025-03-08 05:32:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945689906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301109942] [2025-03-08 05:32:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:02,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:02,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:32:02,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:32:03,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:32:03,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:03,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:03,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:03,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301109942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:03,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:32:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706942755] [2025-03-08 05:32:03,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:03,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:03,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:03,170 INFO L87 Difference]: Start difference. First operand 438 states and 655 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-08 05:32:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:03,310 INFO L93 Difference]: Finished difference Result 1010 states and 1560 transitions. [2025-03-08 05:32:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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 124 [2025-03-08 05:32:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:03,315 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 05:32:03,315 INFO L226 Difference]: Without dead ends: 772 [2025-03-08 05:32:03,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:03,317 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 470 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:03,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1851 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-08 05:32:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 730. [2025-03-08 05:32:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 573 states have (on average 1.5863874345549738) internal successors, (909), 577 states have internal predecessors, (909), 124 states have call successors, (124), 27 states have call predecessors, (124), 32 states have return successors, (147), 125 states have call predecessors, (147), 122 states have call successors, (147) [2025-03-08 05:32:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1180 transitions. [2025-03-08 05:32:03,352 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1180 transitions. Word has length 124 [2025-03-08 05:32:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:03,353 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1180 transitions. [2025-03-08 05:32:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-08 05:32:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1180 transitions. [2025-03-08 05:32:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:32:03,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:03,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:03,365 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-08 05:32:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:32:03,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1576202043, now seen corresponding path program 1 times [2025-03-08 05:32:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172494903] [2025-03-08 05:32:03,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:32:03,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:32:03,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:03,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172494903] [2025-03-08 05:32:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172494903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254342895] [2025-03-08 05:32:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:03,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:03,626 INFO L87 Difference]: Start difference. First operand 730 states and 1180 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-08 05:32:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:03,661 INFO L93 Difference]: Finished difference Result 1695 states and 2788 transitions. [2025-03-08 05:32:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:03,662 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 131 [2025-03-08 05:32:03,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:03,667 INFO L225 Difference]: With dead ends: 1695 [2025-03-08 05:32:03,667 INFO L226 Difference]: Without dead ends: 1032 [2025-03-08 05:32:03,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:03,670 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 97 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:03,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 813 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-08 05:32:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1018. [2025-03-08 05:32:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 797 states have (on average 1.6085319949811794) internal successors, (1282), 801 states have internal predecessors, (1282), 188 states have call successors, (188), 27 states have call predecessors, (188), 32 states have return successors, (221), 189 states have call predecessors, (221), 186 states have call successors, (221) [2025-03-08 05:32:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1691 transitions. [2025-03-08 05:32:03,734 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1691 transitions. Word has length 131 [2025-03-08 05:32:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:03,736 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1691 transitions. [2025-03-08 05:32:03,736 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-08 05:32:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1691 transitions. [2025-03-08 05:32:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:32:03,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:03,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:03,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:03,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:03,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1686412816, now seen corresponding path program 1 times [2025-03-08 05:32:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784713303] [2025-03-08 05:32:03,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:03,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:32:03,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:32:03,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:03,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:03,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:03,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784713303] [2025-03-08 05:32:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784713303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:03,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:03,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143715078] [2025-03-08 05:32:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:03,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:03,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:03,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:03,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:03,805 INFO L87 Difference]: Start difference. First operand 1018 states and 1691 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-08 05:32:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:03,854 INFO L93 Difference]: Finished difference Result 2382 states and 3989 transitions. [2025-03-08 05:32:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:03,854 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 132 [2025-03-08 05:32:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:03,862 INFO L225 Difference]: With dead ends: 2382 [2025-03-08 05:32:03,862 INFO L226 Difference]: Without dead ends: 1480 [2025-03-08 05:32:03,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:03,866 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 95 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:03,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-03-08 05:32:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1466. [2025-03-08 05:32:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1150 states have (on average 1.6252173913043477) internal successors, (1869), 1154 states have internal predecessors, (1869), 283 states have call successors, (283), 27 states have call predecessors, (283), 32 states have return successors, (316), 284 states have call predecessors, (316), 281 states have call successors, (316) [2025-03-08 05:32:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2468 transitions. [2025-03-08 05:32:03,944 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2468 transitions. Word has length 132 [2025-03-08 05:32:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:03,944 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2468 transitions. [2025-03-08 05:32:03,945 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-08 05:32:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2468 transitions. [2025-03-08 05:32:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:32:03,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:03,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:03,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:03,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1533494588, now seen corresponding path program 1 times [2025-03-08 05:32:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481738762] [2025-03-08 05:32:03,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:32:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:32:03,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:03,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481738762] [2025-03-08 05:32:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481738762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099889789] [2025-03-08 05:32:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:04,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:04,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,016 INFO L87 Difference]: Start difference. First operand 1466 states and 2468 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-08 05:32:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:04,087 INFO L93 Difference]: Finished difference Result 3383 states and 5750 transitions. [2025-03-08 05:32:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:04,088 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 133 [2025-03-08 05:32:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:04,099 INFO L225 Difference]: With dead ends: 3383 [2025-03-08 05:32:04,100 INFO L226 Difference]: Without dead ends: 2151 [2025-03-08 05:32:04,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,107 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 93 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:04,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 795 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2025-03-08 05:32:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2137. [2025-03-08 05:32:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1698 states have (on average 1.6389870435806833) internal successors, (2783), 1702 states have internal predecessors, (2783), 406 states have call successors, (406), 27 states have call predecessors, (406), 32 states have return successors, (455), 407 states have call predecessors, (455), 404 states have call successors, (455) [2025-03-08 05:32:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3644 transitions. [2025-03-08 05:32:04,223 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3644 transitions. Word has length 133 [2025-03-08 05:32:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:04,224 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3644 transitions. [2025-03-08 05:32:04,224 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-08 05:32:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3644 transitions. [2025-03-08 05:32:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:32:04,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:04,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:04,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:04,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:04,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1253060175, now seen corresponding path program 1 times [2025-03-08 05:32:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754091793] [2025-03-08 05:32:04,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:04,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:32:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:32:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754091793] [2025-03-08 05:32:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754091793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965651610] [2025-03-08 05:32:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:04,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:04,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:04,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,302 INFO L87 Difference]: Start difference. First operand 2137 states and 3644 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-08 05:32:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:04,409 INFO L93 Difference]: Finished difference Result 4925 states and 8470 transitions. [2025-03-08 05:32:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:04,410 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 134 [2025-03-08 05:32:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:04,427 INFO L225 Difference]: With dead ends: 4925 [2025-03-08 05:32:04,427 INFO L226 Difference]: Without dead ends: 3215 [2025-03-08 05:32:04,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,435 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 91 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:04,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 795 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2025-03-08 05:32:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3201. [2025-03-08 05:32:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2583 states have (on average 1.6488579171506001) internal successors, (4259), 2587 states have internal predecessors, (4259), 585 states have call successors, (585), 27 states have call predecessors, (585), 32 states have return successors, (660), 586 states have call predecessors, (660), 583 states have call successors, (660) [2025-03-08 05:32:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 5504 transitions. [2025-03-08 05:32:04,590 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 5504 transitions. Word has length 134 [2025-03-08 05:32:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:04,591 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 5504 transitions. [2025-03-08 05:32:04,591 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-08 05:32:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 5504 transitions. [2025-03-08 05:32:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:32:04,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:04,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:04,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:04,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:04,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1623531037, now seen corresponding path program 1 times [2025-03-08 05:32:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:04,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265101531] [2025-03-08 05:32:04,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:04,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:32:04,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:32:04,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:04,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:04,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265101531] [2025-03-08 05:32:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265101531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300615745] [2025-03-08 05:32:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:04,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:04,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:04,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,695 INFO L87 Difference]: Start difference. First operand 3201 states and 5504 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-08 05:32:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:04,819 INFO L93 Difference]: Finished difference Result 7710 states and 13336 transitions. [2025-03-08 05:32:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:04,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-08 05:32:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:04,844 INFO L225 Difference]: With dead ends: 7710 [2025-03-08 05:32:04,844 INFO L226 Difference]: Without dead ends: 5152 [2025-03-08 05:32:04,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:04,854 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 89 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:04,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 811 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2025-03-08 05:32:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 5138. [2025-03-08 05:32:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5138 states, 4144 states have (on average 1.6450289575289576) internal successors, (6817), 4148 states have internal predecessors, (6817), 961 states have call successors, (961), 27 states have call predecessors, (961), 32 states have return successors, (1080), 962 states have call predecessors, (1080), 959 states have call successors, (1080) [2025-03-08 05:32:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 8858 transitions. [2025-03-08 05:32:05,107 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 8858 transitions. Word has length 135 [2025-03-08 05:32:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 5138 states and 8858 transitions. [2025-03-08 05:32:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-08 05:32:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 8858 transitions. [2025-03-08 05:32:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:32:05,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:05,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:05,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -842501266, now seen corresponding path program 1 times [2025-03-08 05:32:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116583390] [2025-03-08 05:32:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:05,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:32:05,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:32:05,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:05,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116583390] [2025-03-08 05:32:05,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116583390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:05,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:05,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116311896] [2025-03-08 05:32:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:05,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:05,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:05,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:05,182 INFO L87 Difference]: Start difference. First operand 5138 states and 8858 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-08 05:32:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:05,406 INFO L93 Difference]: Finished difference Result 12614 states and 21896 transitions. [2025-03-08 05:32:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:05,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-08 05:32:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:05,452 INFO L225 Difference]: With dead ends: 12614 [2025-03-08 05:32:05,452 INFO L226 Difference]: Without dead ends: 8474 [2025-03-08 05:32:05,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:05,466 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 87 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:05,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8474 states. [2025-03-08 05:32:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8474 to 8460. [2025-03-08 05:32:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8460 states, 6860 states have (on average 1.6450437317784257) internal successors, (11285), 6864 states have internal predecessors, (11285), 1567 states have call successors, (1567), 27 states have call predecessors, (1567), 32 states have return successors, (1764), 1568 states have call predecessors, (1764), 1565 states have call successors, (1764) [2025-03-08 05:32:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 14616 transitions. [2025-03-08 05:32:05,859 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 14616 transitions. Word has length 136 [2025-03-08 05:32:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 8460 states and 14616 transitions. [2025-03-08 05:32:05,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-08 05:32:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 14616 transitions. [2025-03-08 05:32:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:32:05,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:05,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:05,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:05,896 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:05,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 314407774, now seen corresponding path program 1 times [2025-03-08 05:32:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174277354] [2025-03-08 05:32:05,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:05,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:32:05,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:32:05,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:05,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174277354] [2025-03-08 05:32:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174277354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356659484] [2025-03-08 05:32:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:05,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:05,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:05,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:05,963 INFO L87 Difference]: Start difference. First operand 8460 states and 14616 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-08 05:32:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:06,471 INFO L93 Difference]: Finished difference Result 21833 states and 37881 transitions. [2025-03-08 05:32:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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 137 [2025-03-08 05:32:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:06,536 INFO L225 Difference]: With dead ends: 21833 [2025-03-08 05:32:06,537 INFO L226 Difference]: Without dead ends: 14764 [2025-03-08 05:32:06,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:06,560 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 85 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:06,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 816 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14764 states. [2025-03-08 05:32:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14764 to 14750. [2025-03-08 05:32:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14750 states, 11947 states have (on average 1.6362266677827069) internal successors, (19548), 11951 states have internal predecessors, (19548), 2770 states have call successors, (2770), 27 states have call predecessors, (2770), 32 states have return successors, (3111), 2771 states have call predecessors, (3111), 2768 states have call successors, (3111) [2025-03-08 05:32:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14750 states to 14750 states and 25429 transitions. [2025-03-08 05:32:07,156 INFO L78 Accepts]: Start accepts. Automaton has 14750 states and 25429 transitions. Word has length 137 [2025-03-08 05:32:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 14750 states and 25429 transitions. [2025-03-08 05:32:07,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-08 05:32:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 14750 states and 25429 transitions. [2025-03-08 05:32:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:32:07,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:07,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:07,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:07,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:07,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1529845709, now seen corresponding path program 1 times [2025-03-08 05:32:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144549917] [2025-03-08 05:32:07,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:07,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:32:07,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:32:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:07,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144549917] [2025-03-08 05:32:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144549917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109547608] [2025-03-08 05:32:07,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:07,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:07,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:07,260 INFO L87 Difference]: Start difference. First operand 14750 states and 25429 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 05:32:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:07,848 INFO L93 Difference]: Finished difference Result 38954 states and 67489 transitions. [2025-03-08 05:32:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 138 [2025-03-08 05:32:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:07,967 INFO L225 Difference]: With dead ends: 38954 [2025-03-08 05:32:07,967 INFO L226 Difference]: Without dead ends: 26165 [2025-03-08 05:32:08,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:08,020 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 83 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:08,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 798 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26165 states. [2025-03-08 05:32:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26165 to 26151. [2025-03-08 05:32:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26151 states, 21309 states have (on average 1.6325026983903514) internal successors, (34787), 21313 states have internal predecessors, (34787), 4809 states have call successors, (4809), 27 states have call predecessors, (4809), 32 states have return successors, (5424), 4810 states have call predecessors, (5424), 4807 states have call successors, (5424) [2025-03-08 05:32:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26151 states to 26151 states and 45020 transitions. [2025-03-08 05:32:09,361 INFO L78 Accepts]: Start accepts. Automaton has 26151 states and 45020 transitions. Word has length 138 [2025-03-08 05:32:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:09,361 INFO L471 AbstractCegarLoop]: Abstraction has 26151 states and 45020 transitions. [2025-03-08 05:32:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 05:32:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26151 states and 45020 transitions. [2025-03-08 05:32:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:32:09,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:09,408 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:32:09,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1337787798, now seen corresponding path program 2 times [2025-03-08 05:32:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34122498] [2025-03-08 05:32:09,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:09,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-03-08 05:32:09,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 139 statements. [2025-03-08 05:32:09,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:09,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 05:32:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:09,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34122498] [2025-03-08 05:32:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34122498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:09,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:32:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631030378] [2025-03-08 05:32:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:09,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:32:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:09,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:32:09,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:09,658 INFO L87 Difference]: Start difference. First operand 26151 states and 45020 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:32:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:10,070 INFO L93 Difference]: Finished difference Result 26446 states and 45432 transitions. [2025-03-08 05:32:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:32:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 139 [2025-03-08 05:32:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:10,172 INFO L225 Difference]: With dead ends: 26446 [2025-03-08 05:32:10,173 INFO L226 Difference]: Without dead ends: 26218 [2025-03-08 05:32:10,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:10,191 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 29 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:10,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3132 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26218 states. [2025-03-08 05:32:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26218 to 26205. [2025-03-08 05:32:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26205 states, 21347 states have (on average 1.6320326041129902) internal successors, (34839), 21355 states have internal predecessors, (34839), 4821 states have call successors, (4821), 27 states have call predecessors, (4821), 36 states have return successors, (5440), 4822 states have call predecessors, (5440), 4819 states have call successors, (5440) [2025-03-08 05:32:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26205 states to 26205 states and 45100 transitions. [2025-03-08 05:32:11,071 INFO L78 Accepts]: Start accepts. Automaton has 26205 states and 45100 transitions. Word has length 139 [2025-03-08 05:32:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,071 INFO L471 AbstractCegarLoop]: Abstraction has 26205 states and 45100 transitions. [2025-03-08 05:32:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:32:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26205 states and 45100 transitions. [2025-03-08 05:32:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:32:11,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:11,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:32:11,111 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2107982936, now seen corresponding path program 1 times [2025-03-08 05:32:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746975038] [2025-03-08 05:32:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:32:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:32:11,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:32:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746975038] [2025-03-08 05:32:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746975038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013343279] [2025-03-08 05:32:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:11,198 INFO L87 Difference]: Start difference. First operand 26205 states and 45100 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-08 05:32:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,742 INFO L93 Difference]: Finished difference Result 49560 states and 85443 transitions. [2025-03-08 05:32:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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 140 [2025-03-08 05:32:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,854 INFO L225 Difference]: With dead ends: 49560 [2025-03-08 05:32:11,855 INFO L226 Difference]: Without dead ends: 26219 [2025-03-08 05:32:11,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:11,919 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 96 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:11,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1967 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26219 states. [2025-03-08 05:32:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26219 to 26205. [2025-03-08 05:32:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26205 states, 21347 states have (on average 1.619571836792055) internal successors, (34573), 21355 states have internal predecessors, (34573), 4821 states have call successors, (4821), 27 states have call predecessors, (4821), 36 states have return successors, (5440), 4822 states have call predecessors, (5440), 4819 states have call successors, (5440) [2025-03-08 05:32:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26205 states to 26205 states and 44834 transitions. [2025-03-08 05:32:13,140 INFO L78 Accepts]: Start accepts. Automaton has 26205 states and 44834 transitions. Word has length 140 [2025-03-08 05:32:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 26205 states and 44834 transitions. [2025-03-08 05:32:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-08 05:32:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26205 states and 44834 transitions. [2025-03-08 05:32:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:32:13,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:32:13,186 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1814806751, now seen corresponding path program 1 times [2025-03-08 05:32:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535740141] [2025-03-08 05:32:13,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:32:13,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:32:13,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535740141] [2025-03-08 05:32:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535740141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771178521] [2025-03-08 05:32:13,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:13,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:13,256 INFO L87 Difference]: Start difference. First operand 26205 states and 44834 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (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-08 05:32:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,584 INFO L93 Difference]: Finished difference Result 71234 states and 122321 transitions. [2025-03-08 05:32:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (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 140 [2025-03-08 05:32:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,750 INFO L225 Difference]: With dead ends: 71234 [2025-03-08 05:32:14,751 INFO L226 Difference]: Without dead ends: 47676 [2025-03-08 05:32:14,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,810 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 81 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:14,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 801 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47676 states. [2025-03-08 05:32:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47676 to 47662. [2025-03-08 05:32:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47662 states, 39089 states have (on average 1.6133694901378905) internal successors, (63065), 39097 states have internal predecessors, (63065), 8536 states have call successors, (8536), 27 states have call predecessors, (8536), 36 states have return successors, (9687), 8537 states have call predecessors, (9687), 8534 states have call successors, (9687) [2025-03-08 05:32:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47662 states to 47662 states and 81288 transitions. [2025-03-08 05:32:16,310 INFO L78 Accepts]: Start accepts. Automaton has 47662 states and 81288 transitions. Word has length 140 [2025-03-08 05:32:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,311 INFO L471 AbstractCegarLoop]: Abstraction has 47662 states and 81288 transitions. [2025-03-08 05:32:16,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (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-08 05:32:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 47662 states and 81288 transitions. [2025-03-08 05:32:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:32:16,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:32:16,366 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1504103310, now seen corresponding path program 1 times [2025-03-08 05:32:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099621874] [2025-03-08 05:32:16,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:32:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:32:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099621874] [2025-03-08 05:32:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099621874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747005912] [2025-03-08 05:32:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:16,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:16,418 INFO L87 Difference]: Start difference. First operand 47662 states and 81288 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-08 05:32:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:18,487 INFO L93 Difference]: Finished difference Result 88691 states and 151598 transitions. [2025-03-08 05:32:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:18,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 141 [2025-03-08 05:32:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:18,832 INFO L225 Difference]: With dead ends: 88691 [2025-03-08 05:32:18,832 INFO L226 Difference]: Without dead ends: 88399 [2025-03-08 05:32:18,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,882 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 76 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:18,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 812 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88399 states. [2025-03-08 05:32:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88399 to 88385. [2025-03-08 05:32:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88385 states, 73013 states have (on average 1.605426430909564) internal successors, (117217), 73021 states have internal predecessors, (117217), 15335 states have call successors, (15335), 27 states have call predecessors, (15335), 36 states have return successors, (17532), 15336 states have call predecessors, (17532), 15333 states have call successors, (17532) [2025-03-08 05:32:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88385 states to 88385 states and 150084 transitions. [2025-03-08 05:32:22,191 INFO L78 Accepts]: Start accepts. Automaton has 88385 states and 150084 transitions. Word has length 141 [2025-03-08 05:32:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 88385 states and 150084 transitions. [2025-03-08 05:32:22,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-08 05:32:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 88385 states and 150084 transitions. [2025-03-08 05:32:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:32:22,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:22,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:22,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:32:22,282 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1748161890, now seen corresponding path program 1 times [2025-03-08 05:32:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698908768] [2025-03-08 05:32:22,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:22,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:32:22,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:32:22,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698908768] [2025-03-08 05:32:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698908768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 05:32:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342238192] [2025-03-08 05:32:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:22,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:32:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:22,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:32:22,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:22,530 INFO L87 Difference]: Start difference. First operand 88385 states and 150084 transitions. Second operand has 11 states, 9 states have (on average 11.0) internal successors, (99), 10 states have internal predecessors, (99), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:32:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:24,624 INFO L93 Difference]: Finished difference Result 88740 states and 150579 transitions. [2025-03-08 05:32:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:32:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 11.0) internal successors, (99), 10 states have internal predecessors, (99), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 142 [2025-03-08 05:32:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:24,984 INFO L225 Difference]: With dead ends: 88740 [2025-03-08 05:32:24,985 INFO L226 Difference]: Without dead ends: 88434 [2025-03-08 05:32:25,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:32:25,047 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 95 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:25,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 3905 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88434 states. [2025-03-08 05:32:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88434 to 88430. [2025-03-08 05:32:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88430 states, 73049 states have (on average 1.6052649591370176) internal successors, (117263), 73056 states have internal predecessors, (117263), 15345 states have call successors, (15345), 28 states have call predecessors, (15345), 35 states have return successors, (17540), 15345 states have call predecessors, (17540), 15343 states have call successors, (17540) [2025-03-08 05:32:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88430 states to 88430 states and 150148 transitions. [2025-03-08 05:32:27,731 INFO L78 Accepts]: Start accepts. Automaton has 88430 states and 150148 transitions. Word has length 142 [2025-03-08 05:32:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:27,732 INFO L471 AbstractCegarLoop]: Abstraction has 88430 states and 150148 transitions. [2025-03-08 05:32:27,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 11.0) internal successors, (99), 10 states have internal predecessors, (99), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:32:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 88430 states and 150148 transitions. [2025-03-08 05:32:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:32:27,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:27,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:27,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:32:27,903 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2110393016, now seen corresponding path program 1 times [2025-03-08 05:32:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104175711] [2025-03-08 05:32:27,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:27,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:32:27,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:32:27,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:27,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:32:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104175711] [2025-03-08 05:32:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104175711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:28,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642095528] [2025-03-08 05:32:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:28,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:28,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:28,080 INFO L87 Difference]: Start difference. First operand 88430 states and 150148 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:32:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:30,115 INFO L93 Difference]: Finished difference Result 89067 states and 151033 transitions. [2025-03-08 05:32:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-03-08 05:32:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:30,433 INFO L225 Difference]: With dead ends: 89067 [2025-03-08 05:32:30,434 INFO L226 Difference]: Without dead ends: 88765 [2025-03-08 05:32:30,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:30,475 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 340 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:30,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2159 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:32:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88765 states.