./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product15.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 b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:17,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:18,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:18,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:18,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:18,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:18,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:18,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:18,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:18,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:18,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:18,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:18,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:18,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:18,060 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:18,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:18,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:18,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:18,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:18,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:18,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:18,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:18,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:18,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:18,063 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 -> b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d [2025-03-03 14:26:18,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:18,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:18,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:18,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:18,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:18,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-03-03 14:26:19,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edc0fd7a/f187724edd0240af9fca31e63ae36821/FLAG26ff53fa1 [2025-03-03 14:26:19,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:19,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-03-03 14:26:19,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edc0fd7a/f187724edd0240af9fca31e63ae36821/FLAG26ff53fa1 [2025-03-03 14:26:19,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edc0fd7a/f187724edd0240af9fca31e63ae36821 [2025-03-03 14:26:19,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:19,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:19,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:19,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:19,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:19,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:19" (1/1) ... [2025-03-03 14:26:19,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62392389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:19, skipping insertion in model container [2025-03-03 14:26:19,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:19" (1/1) ... [2025-03-03 14:26:19,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:20,271 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_spec8_product15.cil.c[44955,44968] [2025-03-03 14:26:20,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:20,348 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:20,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-03 14:26:20,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [460] [2025-03-03 14:26:20,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [750] [2025-03-03 14:26:20,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1824] [2025-03-03 14:26:20,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2112] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2155] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2164] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2268] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2484] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2501] [2025-03-03 14:26:20,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2867] [2025-03-03 14:26:20,432 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_spec8_product15.cil.c[44955,44968] [2025-03-03 14:26:20,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:20,487 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:20,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20 WrapperNode [2025-03-03 14:26:20,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:20,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:20,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:20,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:20,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,556 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 55, calls inlined = 46, statements flattened = 889 [2025-03-03 14:26:20,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:20,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:20,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:20,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:20,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,585 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:26:20,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:20,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:20,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:20,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:20,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (1/1) ... [2025-03-03 14:26:20,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:20,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:20,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:20,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:20,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:21,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1366-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~25#1; [2025-03-03 14:26:21,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~15#1; [2025-03-03 14:26:21,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~30#1; [2025-03-03 14:26:21,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1319-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~24#1; [2025-03-03 14:26:21,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801-1: getClientId_#res#1 := getClientId_~retValue_acc~32#1; [2025-03-03 14:26:21,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-03 14:26:21,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1458: #res#1 := ~retValue_acc~27#1; [2025-03-03 14:26:21,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1413-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~26#1; [2025-03-03 14:26:21,125 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265-1: createEmail_#res#1 := createEmail_~retValue_acc~37#1; [2025-03-03 14:26:21,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-03 14:26:21,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L688-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-03 14:26:21,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-03 14:26:21,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899-1: valid_product_#res#1 := valid_product_~retValue_acc~43#1; [2025-03-03 14:26:21,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1628-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~29#1; [2025-03-03 14:26:21,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~28#1; [2025-03-03 14:26:21,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-03 14:26:21,344 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-03 14:26:21,363 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-03 14:26:21,458 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:21,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:21,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:21,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:21,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:21 BoogieIcfgContainer [2025-03-03 14:26:21,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:21,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:21,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:21,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:21,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:19" (1/3) ... [2025-03-03 14:26:21,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6ea85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:21, skipping insertion in model container [2025-03-03 14:26:21,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:20" (2/3) ... [2025-03-03 14:26:21,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6ea85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:21, skipping insertion in model container [2025-03-03 14:26:21,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:21" (3/3) ... [2025-03-03 14:26:21,474 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product15.cil.c [2025-03-03 14:26:21,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:21,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product15.cil.c that has 18 procedures, 286 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:21,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:21,547 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;@52854b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:21,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 225 states have (on average 1.5422222222222222) internal successors, (347), 229 states have internal predecessors, (347), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 14:26:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:26:21,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,562 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] [2025-03-03 14:26:21,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2114162301, now seen corresponding path program 1 times [2025-03-03 14:26:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732201625] [2025-03-03 14:26:21,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:26:21,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:26:21,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732201625] [2025-03-03 14:26:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732201625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605567704] [2025-03-03 14:26:22,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:22,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:22,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:26:22,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:26:22,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:26:22,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:26:22,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:22,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605567704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:22,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:26:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91756248] [2025-03-03 14:26:22,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:22,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:22,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:22,432 INFO L87 Difference]: Start difference. First operand has 286 states, 225 states have (on average 1.5422222222222222) internal successors, (347), 229 states have internal predecessors, (347), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:22,466 INFO L93 Difference]: Finished difference Result 419 states and 618 transitions. [2025-03-03 14:26:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-03-03 14:26:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:22,480 INFO L225 Difference]: With dead ends: 419 [2025-03-03 14:26:22,480 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 14:26:22,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:22,487 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:22,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 14:26:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-03 14:26:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 219 states have (on average 1.538812785388128) internal successors, (337), 222 states have internal predecessors, (337), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:26:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 420 transitions. [2025-03-03 14:26:22,536 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 420 transitions. Word has length 89 [2025-03-03 14:26:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-03-03 14:26:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 420 transitions. [2025-03-03 14:26:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:26:22,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:22,544 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] [2025-03-03 14:26:22,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:26:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:26:22,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 586126234, now seen corresponding path program 1 times [2025-03-03 14:26:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37541899] [2025-03-03 14:26:22,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:26:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:26:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37541899] [2025-03-03 14:26:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37541899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853776150] [2025-03-03 14:26:22,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:22,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:22,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:26:23,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:26:23,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:26:23,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:23,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:23,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853776150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892256277] [2025-03-03 14:26:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:23,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:23,251 INFO L87 Difference]: Start difference. First operand 279 states and 420 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,292 INFO L93 Difference]: Finished difference Result 408 states and 599 transitions. [2025-03-03 14:26:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-03 14:26:23,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,295 INFO L225 Difference]: With dead ends: 408 [2025-03-03 14:26:23,298 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 14:26:23,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:23,299 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:23,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 836 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 14:26:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-03 14:26:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 224 states have internal predecessors, (339), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:26:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 422 transitions. [2025-03-03 14:26:23,323 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 422 transitions. Word has length 90 [2025-03-03 14:26:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,323 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 422 transitions. [2025-03-03 14:26:23,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 422 transitions. [2025-03-03 14:26:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:26:23,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:23,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:23,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:26:23,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash -861086804, now seen corresponding path program 1 times [2025-03-03 14:26:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44957915] [2025-03-03 14:26:23,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:23,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44957915] [2025-03-03 14:26:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44957915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359247506] [2025-03-03 14:26:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:23,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:23,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:26:23,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:23,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:23,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:23,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:24,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359247506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:24,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657488874] [2025-03-03 14:26:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:24,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:24,014 INFO L87 Difference]: Start difference. First operand 281 states and 422 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:24,049 INFO L93 Difference]: Finished difference Result 591 states and 902 transitions. [2025-03-03 14:26:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:24,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-03 14:26:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:24,052 INFO L225 Difference]: With dead ends: 591 [2025-03-03 14:26:24,052 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 14:26:24,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:24,055 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 107 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:24,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 799 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 14:26:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2025-03-03 14:26:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 258 states have (on average 1.550387596899225) internal successors, (400), 261 states have internal predecessors, (400), 53 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:26:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 505 transitions. [2025-03-03 14:26:24,087 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 505 transitions. Word has length 98 [2025-03-03 14:26:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,089 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 505 transitions. [2025-03-03 14:26:24,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2025-03-03 14:26:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:26:24,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:24,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:24,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1521268613, now seen corresponding path program 1 times [2025-03-03 14:26:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184685986] [2025-03-03 14:26:24,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184685986] [2025-03-03 14:26:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184685986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027822673] [2025-03-03 14:26:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:24,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:24,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:26:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:24,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:24,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:26:24,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:24,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027822673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:26:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671725481] [2025-03-03 14:26:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:24,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:24,728 INFO L87 Difference]: Start difference. First operand 329 states and 505 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:24,780 INFO L93 Difference]: Finished difference Result 649 states and 1000 transitions. [2025-03-03 14:26:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-03-03 14:26:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:24,783 INFO L225 Difference]: With dead ends: 649 [2025-03-03 14:26:24,783 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 14:26:24,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:24,784 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:24,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1637 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 14:26:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-03-03 14:26:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 263 states have internal predecessors, (401), 53 states have call successors, (53), 17 states have call predecessors, (53), 18 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2025-03-03 14:26:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 508 transitions. [2025-03-03 14:26:24,803 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 508 transitions. Word has length 99 [2025-03-03 14:26:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,804 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 508 transitions. [2025-03-03 14:26:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 508 transitions. [2025-03-03 14:26:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:26:24,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:24,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:26:25,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:25,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2000221588, now seen corresponding path program 1 times [2025-03-03 14:26:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518943390] [2025-03-03 14:26:25,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:26:25,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:26:25,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:26:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518943390] [2025-03-03 14:26:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518943390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413375800] [2025-03-03 14:26:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:25,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:25,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:25,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:26:25,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:26:25,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:26:25,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:26:25,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:25,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413375800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:26:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948115949] [2025-03-03 14:26:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:25,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:25,406 INFO L87 Difference]: Start difference. First operand 331 states and 508 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,455 INFO L93 Difference]: Finished difference Result 651 states and 1005 transitions. [2025-03-03 14:26:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-03-03 14:26:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,459 INFO L225 Difference]: With dead ends: 651 [2025-03-03 14:26:25,460 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 14:26:25,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:25,464 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 2 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:25,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1623 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 14:26:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 14:26:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 260 states have (on average 1.5461538461538462) internal successors, (402), 265 states have internal predecessors, (402), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2025-03-03 14:26:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 514 transitions. [2025-03-03 14:26:25,482 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 514 transitions. Word has length 100 [2025-03-03 14:26:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,483 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 514 transitions. [2025-03-03 14:26:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 514 transitions. [2025-03-03 14:26:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:26:25,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,485 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] [2025-03-03 14:26:25,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:26:25,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:25,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1643110002, now seen corresponding path program 1 times [2025-03-03 14:26:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252808153] [2025-03-03 14:26:25,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:26:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:26:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252808153] [2025-03-03 14:26:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252808153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740843519] [2025-03-03 14:26:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:25,810 INFO L87 Difference]: Start difference. First operand 333 states and 514 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,857 INFO L93 Difference]: Finished difference Result 643 states and 996 transitions. [2025-03-03 14:26:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-03-03 14:26:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,860 INFO L225 Difference]: With dead ends: 643 [2025-03-03 14:26:25,860 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 14:26:25,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:25,861 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 2 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:25,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1641 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 14:26:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 14:26:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 260 states have (on average 1.5461538461538462) internal successors, (402), 265 states have internal predecessors, (402), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2025-03-03 14:26:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 513 transitions. [2025-03-03 14:26:25,875 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 513 transitions. Word has length 101 [2025-03-03 14:26:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,875 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 513 transitions. [2025-03-03 14:26:25,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 513 transitions. [2025-03-03 14:26:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:26:25,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:26:25,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2092908869, now seen corresponding path program 2 times [2025-03-03 14:26:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309097864] [2025-03-03 14:26:25,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-03 14:26:25,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:26:25,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:26:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309097864] [2025-03-03 14:26:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309097864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28354974] [2025-03-03 14:26:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:25,993 INFO L87 Difference]: Start difference. First operand 333 states and 513 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,037 INFO L93 Difference]: Finished difference Result 641 states and 991 transitions. [2025-03-03 14:26:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-03-03 14:26:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,040 INFO L225 Difference]: With dead ends: 641 [2025-03-03 14:26:26,040 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 14:26:26,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:26,043 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 2 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1627 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 14:26:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 14:26:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 260 states have (on average 1.5461538461538462) internal successors, (402), 265 states have internal predecessors, (402), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (57), 52 states have call predecessors, (57), 52 states have call successors, (57) [2025-03-03 14:26:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 512 transitions. [2025-03-03 14:26:26,061 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 512 transitions. Word has length 102 [2025-03-03 14:26:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,062 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 512 transitions. [2025-03-03 14:26:26,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 512 transitions. [2025-03-03 14:26:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:26:26,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:26:26,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 996107117, now seen corresponding path program 3 times [2025-03-03 14:26:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066442136] [2025-03-03 14:26:26,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:26:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 103 statements into 3 equivalence classes. [2025-03-03 14:26:26,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 91 of 103 statements. [2025-03-03 14:26:26,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:26:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066442136] [2025-03-03 14:26:26,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066442136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521482966] [2025-03-03 14:26:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:26,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:26,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:26,159 INFO L87 Difference]: Start difference. First operand 333 states and 512 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,203 INFO L93 Difference]: Finished difference Result 643 states and 997 transitions. [2025-03-03 14:26:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-03-03 14:26:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,206 INFO L225 Difference]: With dead ends: 643 [2025-03-03 14:26:26,206 INFO L226 Difference]: Without dead ends: 335 [2025-03-03 14:26:26,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:26,208 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1638 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-03 14:26:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-03-03 14:26:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 261 states have (on average 1.5440613026819923) internal successors, (403), 267 states have internal predecessors, (403), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (62), 52 states have call predecessors, (62), 52 states have call successors, (62) [2025-03-03 14:26:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 518 transitions. [2025-03-03 14:26:26,224 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 518 transitions. Word has length 103 [2025-03-03 14:26:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,225 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 518 transitions. [2025-03-03 14:26:26,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 518 transitions. [2025-03-03 14:26:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:26:26,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:26:26,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -490977400, now seen corresponding path program 1 times [2025-03-03 14:26:26,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172445379] [2025-03-03 14:26:26,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:26:26,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:26:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172445379] [2025-03-03 14:26:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172445379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880950020] [2025-03-03 14:26:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:26,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:26,337 INFO L87 Difference]: Start difference. First operand 335 states and 518 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,372 INFO L93 Difference]: Finished difference Result 649 states and 1007 transitions. [2025-03-03 14:26:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-03 14:26:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,374 INFO L225 Difference]: With dead ends: 649 [2025-03-03 14:26:26,374 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 14:26:26,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:26,376 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 14:26:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-03 14:26:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.5419847328244274) internal successors, (404), 269 states have internal predecessors, (404), 53 states have call successors, (53), 17 states have call predecessors, (53), 21 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2025-03-03 14:26:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 521 transitions. [2025-03-03 14:26:26,388 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 521 transitions. Word has length 104 [2025-03-03 14:26:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 521 transitions. [2025-03-03 14:26:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:26:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 521 transitions. [2025-03-03 14:26:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:26:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,390 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] [2025-03-03 14:26:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:26:26,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1309302296, now seen corresponding path program 1 times [2025-03-03 14:26:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627960707] [2025-03-03 14:26:26,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:26:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:26:26,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:26:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627960707] [2025-03-03 14:26:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627960707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875204474] [2025-03-03 14:26:26,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:26,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:26,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:26:26,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:26:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:26:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:26,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:26,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875204474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:26,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:26:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965443375] [2025-03-03 14:26:26,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:26:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:26:26,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:26,830 INFO L87 Difference]: Start difference. First operand 337 states and 521 transitions. Second operand has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:26:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,344 INFO L93 Difference]: Finished difference Result 994 states and 1607 transitions. [2025-03-03 14:26:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:26:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 105 [2025-03-03 14:26:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,351 INFO L225 Difference]: With dead ends: 994 [2025-03-03 14:26:27,351 INFO L226 Difference]: Without dead ends: 686 [2025-03-03 14:26:27,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:26:27,353 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1077 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 2752 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:26:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-03 14:26:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 662. [2025-03-03 14:26:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 523 states have (on average 1.5908221797323137) internal successors, (832), 529 states have internal predecessors, (832), 117 states have call successors, (117), 18 states have call predecessors, (117), 21 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2025-03-03 14:26:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1087 transitions. [2025-03-03 14:26:27,384 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1087 transitions. Word has length 105 [2025-03-03 14:26:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,384 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1087 transitions. [2025-03-03 14:26:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:26:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1087 transitions. [2025-03-03 14:26:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:26:27,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,388 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] [2025-03-03 14:26:27,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:27,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:27,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash -610159870, now seen corresponding path program 1 times [2025-03-03 14:26:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351357578] [2025-03-03 14:26:27,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:26:27,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:26:27,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351357578] [2025-03-03 14:26:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351357578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695388098] [2025-03-03 14:26:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:27,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,643 INFO L87 Difference]: Start difference. First operand 662 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,682 INFO L93 Difference]: Finished difference Result 1549 states and 2587 transitions. [2025-03-03 14:26:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-03 14:26:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,688 INFO L225 Difference]: With dead ends: 1549 [2025-03-03 14:26:27,688 INFO L226 Difference]: Without dead ends: 965 [2025-03-03 14:26:27,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,691 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 104 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 833 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-03-03 14:26:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 957. [2025-03-03 14:26:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 754 states have (on average 1.6074270557029178) internal successors, (1212), 760 states have internal predecessors, (1212), 181 states have call successors, (181), 18 states have call predecessors, (181), 21 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2025-03-03 14:26:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1605 transitions. [2025-03-03 14:26:27,745 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1605 transitions. Word has length 108 [2025-03-03 14:26:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1605 transitions. [2025-03-03 14:26:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1605 transitions. [2025-03-03 14:26:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:26:27,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,751 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] [2025-03-03 14:26:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:26:27,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 286626058, now seen corresponding path program 1 times [2025-03-03 14:26:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617030939] [2025-03-03 14:26:27,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:26:27,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:26:27,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617030939] [2025-03-03 14:26:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617030939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759233476] [2025-03-03 14:26:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:27,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,802 INFO L87 Difference]: Start difference. First operand 957 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,855 INFO L93 Difference]: Finished difference Result 2278 states and 3840 transitions. [2025-03-03 14:26:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-03 14:26:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,868 INFO L225 Difference]: With dead ends: 2278 [2025-03-03 14:26:27,868 INFO L226 Difference]: Without dead ends: 1450 [2025-03-03 14:26:27,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,873 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 102 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 840 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-03 14:26:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1442. [2025-03-03 14:26:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1144 states have (on average 1.6136363636363635) internal successors, (1846), 1150 states have internal predecessors, (1846), 276 states have call successors, (276), 18 states have call predecessors, (276), 21 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2025-03-03 14:26:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2429 transitions. [2025-03-03 14:26:27,960 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2429 transitions. Word has length 109 [2025-03-03 14:26:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,961 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2429 transitions. [2025-03-03 14:26:27,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2429 transitions. [2025-03-03 14:26:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:26:27,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,968 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] [2025-03-03 14:26:27,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:26:27,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1962129821, now seen corresponding path program 1 times [2025-03-03 14:26:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961487682] [2025-03-03 14:26:27,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:26:28,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:26:28,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:28,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:28,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961487682] [2025-03-03 14:26:28,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961487682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:28,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:28,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288925678] [2025-03-03 14:26:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:28,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:28,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,046 INFO L87 Difference]: Start difference. First operand 1442 states and 2429 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:28,115 INFO L93 Difference]: Finished difference Result 3362 states and 5706 transitions. [2025-03-03 14:26:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-03 14:26:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:28,127 INFO L225 Difference]: With dead ends: 3362 [2025-03-03 14:26:28,127 INFO L226 Difference]: Without dead ends: 2181 [2025-03-03 14:26:28,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,132 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 100 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:28,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 827 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2025-03-03 14:26:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2173. [2025-03-03 14:26:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1752 states have (on average 1.6187214611872147) internal successors, (2836), 1758 states have internal predecessors, (2836), 399 states have call successors, (399), 18 states have call predecessors, (399), 21 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2025-03-03 14:26:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3681 transitions. [2025-03-03 14:26:28,227 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3681 transitions. Word has length 110 [2025-03-03 14:26:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:28,227 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 3681 transitions. [2025-03-03 14:26:28,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3681 transitions. [2025-03-03 14:26:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:26:28,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:28,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] [2025-03-03 14:26:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:26:28,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:28,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -103904247, now seen corresponding path program 1 times [2025-03-03 14:26:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944615542] [2025-03-03 14:26:28,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:28,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:26:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:26:28,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944615542] [2025-03-03 14:26:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944615542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289500551] [2025-03-03 14:26:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:28,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:28,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,291 INFO L87 Difference]: Start difference. First operand 2173 states and 3681 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:28,412 INFO L93 Difference]: Finished difference Result 5040 states and 8598 transitions. [2025-03-03 14:26:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-03 14:26:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:28,431 INFO L225 Difference]: With dead ends: 5040 [2025-03-03 14:26:28,431 INFO L226 Difference]: Without dead ends: 3343 [2025-03-03 14:26:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,438 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 98 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 827 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2025-03-03 14:26:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3335. [2025-03-03 14:26:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2735 states have (on average 1.6219378427787934) internal successors, (4436), 2741 states have internal predecessors, (4436), 578 states have call successors, (578), 18 states have call predecessors, (578), 21 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2025-03-03 14:26:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 5665 transitions. [2025-03-03 14:26:28,640 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 5665 transitions. Word has length 111 [2025-03-03 14:26:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 5665 transitions. [2025-03-03 14:26:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 5665 transitions. [2025-03-03 14:26:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:26:28,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:28,648 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-03 14:26:28,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:26:28,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:28,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash 690611364, now seen corresponding path program 1 times [2025-03-03 14:26:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914258782] [2025-03-03 14:26:28,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:28,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:26:28,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:26:28,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914258782] [2025-03-03 14:26:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914258782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768768331] [2025-03-03 14:26:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,693 INFO L87 Difference]: Start difference. First operand 3335 states and 5665 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:28,885 INFO L93 Difference]: Finished difference Result 8057 states and 13758 transitions. [2025-03-03 14:26:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-03 14:26:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:28,916 INFO L225 Difference]: With dead ends: 8057 [2025-03-03 14:26:28,916 INFO L226 Difference]: Without dead ends: 5445 [2025-03-03 14:26:28,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,926 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 96 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:28,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 840 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5445 states. [2025-03-03 14:26:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5445 to 5437. [2025-03-03 14:26:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5437 states, 4461 states have (on average 1.6146603900470746) internal successors, (7203), 4467 states have internal predecessors, (7203), 954 states have call successors, (954), 18 states have call predecessors, (954), 21 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2025-03-03 14:26:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5437 states to 5437 states and 9228 transitions. [2025-03-03 14:26:29,226 INFO L78 Accepts]: Start accepts. Automaton has 5437 states and 9228 transitions. Word has length 112 [2025-03-03 14:26:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,226 INFO L471 AbstractCegarLoop]: Abstraction has 5437 states and 9228 transitions. [2025-03-03 14:26:29,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5437 states and 9228 transitions. [2025-03-03 14:26:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:26:29,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,238 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] [2025-03-03 14:26:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:26:29,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -277915704, now seen corresponding path program 1 times [2025-03-03 14:26:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508797811] [2025-03-03 14:26:29,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:26:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:26:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508797811] [2025-03-03 14:26:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508797811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179714282] [2025-03-03 14:26:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:29,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:29,311 INFO L87 Difference]: Start difference. First operand 5437 states and 9228 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,522 INFO L93 Difference]: Finished difference Result 13374 states and 22843 transitions. [2025-03-03 14:26:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-03 14:26:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,571 INFO L225 Difference]: With dead ends: 13374 [2025-03-03 14:26:29,571 INFO L226 Difference]: Without dead ends: 9056 [2025-03-03 14:26:29,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:29,590 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 94 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:29,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 834 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9056 states. [2025-03-03 14:26:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9056 to 9048. [2025-03-03 14:26:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9048 states, 7466 states have (on average 1.612376105009376) internal successors, (12038), 7472 states have internal predecessors, (12038), 1560 states have call successors, (1560), 18 states have call predecessors, (1560), 21 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2025-03-03 14:26:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 15353 transitions. [2025-03-03 14:26:30,027 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 15353 transitions. Word has length 113 [2025-03-03 14:26:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:30,027 INFO L471 AbstractCegarLoop]: Abstraction has 9048 states and 15353 transitions. [2025-03-03 14:26:30,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 15353 transitions. [2025-03-03 14:26:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:26:30,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:30,044 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] [2025-03-03 14:26:30,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:26:30,045 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1553862469, now seen corresponding path program 1 times [2025-03-03 14:26:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940783123] [2025-03-03 14:26:30,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:30,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:26:30,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:26:30,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:30,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:30,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940783123] [2025-03-03 14:26:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940783123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958261325] [2025-03-03 14:26:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:30,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:30,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:30,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:30,101 INFO L87 Difference]: Start difference. First operand 9048 states and 15353 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:30,609 INFO L93 Difference]: Finished difference Result 23356 states and 39801 transitions. [2025-03-03 14:26:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-03-03 14:26:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:30,669 INFO L225 Difference]: With dead ends: 23356 [2025-03-03 14:26:30,670 INFO L226 Difference]: Without dead ends: 15872 [2025-03-03 14:26:30,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:30,690 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 92 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:30,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 840 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15872 states. [2025-03-03 14:26:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15872 to 15864. [2025-03-03 14:26:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15864 states, 13079 states have (on average 1.6034100466396513) internal successors, (20971), 13085 states have internal predecessors, (20971), 2763 states have call successors, (2763), 18 states have call predecessors, (2763), 21 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2025-03-03 14:26:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15864 states to 15864 states and 26836 transitions. [2025-03-03 14:26:31,284 INFO L78 Accepts]: Start accepts. Automaton has 15864 states and 26836 transitions. Word has length 114 [2025-03-03 14:26:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:31,284 INFO L471 AbstractCegarLoop]: Abstraction has 15864 states and 26836 transitions. [2025-03-03 14:26:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15864 states and 26836 transitions. [2025-03-03 14:26:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:26:31,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:31,309 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] [2025-03-03 14:26:31,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:26:31,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:31,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1516857, now seen corresponding path program 1 times [2025-03-03 14:26:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955757797] [2025-03-03 14:26:31,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:26:31,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:26:31,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955757797] [2025-03-03 14:26:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955757797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839649949] [2025-03-03 14:26:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,367 INFO L87 Difference]: Start difference. First operand 15864 states and 26836 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:32,072 INFO L93 Difference]: Finished difference Result 41927 states and 71263 transitions. [2025-03-03 14:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:32,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-03-03 14:26:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:32,172 INFO L225 Difference]: With dead ends: 41927 [2025-03-03 14:26:32,172 INFO L226 Difference]: Without dead ends: 28261 [2025-03-03 14:26:32,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:32,215 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 90 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:32,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 830 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28261 states. [2025-03-03 14:26:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28261 to 28253. [2025-03-03 14:26:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28253 states, 23429 states have (on average 1.5993853770967603) internal successors, (37472), 23435 states have internal predecessors, (37472), 4802 states have call successors, (4802), 18 states have call predecessors, (4802), 21 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2025-03-03 14:26:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28253 states to 28253 states and 47689 transitions. [2025-03-03 14:26:33,677 INFO L78 Accepts]: Start accepts. Automaton has 28253 states and 47689 transitions. Word has length 115 [2025-03-03 14:26:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:33,678 INFO L471 AbstractCegarLoop]: Abstraction has 28253 states and 47689 transitions. [2025-03-03 14:26:33,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28253 states and 47689 transitions. [2025-03-03 14:26:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:26:33,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:33,702 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] [2025-03-03 14:26:33,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:26:33,702 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1516431046, now seen corresponding path program 1 times [2025-03-03 14:26:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:33,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708222557] [2025-03-03 14:26:33,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:33,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:26:33,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:26:33,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:33,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708222557] [2025-03-03 14:26:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708222557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:33,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874951702] [2025-03-03 14:26:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:33,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:33,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:33,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:33,760 INFO L87 Difference]: Start difference. First operand 28253 states and 47689 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:34,716 INFO L93 Difference]: Finished difference Result 76909 states and 130315 transitions. [2025-03-03 14:26:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-03-03 14:26:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:34,934 INFO L225 Difference]: With dead ends: 76909 [2025-03-03 14:26:34,935 INFO L226 Difference]: Without dead ends: 51617 [2025-03-03 14:26:35,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:35,017 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 88 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:35,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 835 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51617 states. [2025-03-03 14:26:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51617 to 51609. [2025-03-03 14:26:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51609 states, 43070 states have (on average 1.5939633155328534) internal successors, (68652), 43076 states have internal predecessors, (68652), 8517 states have call successors, (8517), 18 states have call predecessors, (8517), 21 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2025-03-03 14:26:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51609 states to 51609 states and 86831 transitions. [2025-03-03 14:26:37,016 INFO L78 Accepts]: Start accepts. Automaton has 51609 states and 86831 transitions. Word has length 116 [2025-03-03 14:26:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:37,016 INFO L471 AbstractCegarLoop]: Abstraction has 51609 states and 86831 transitions. [2025-03-03 14:26:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 51609 states and 86831 transitions. [2025-03-03 14:26:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:26:37,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:37,044 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] [2025-03-03 14:26:37,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:26:37,044 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:37,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2128422182, now seen corresponding path program 1 times [2025-03-03 14:26:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549726719] [2025-03-03 14:26:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:37,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:26:37,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:26:37,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:37,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549726719] [2025-03-03 14:26:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549726719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:37,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745722273] [2025-03-03 14:26:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:37,114 INFO L87 Difference]: Start difference. First operand 51609 states and 86831 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:38,768 INFO L93 Difference]: Finished difference Result 96170 states and 162166 transitions. [2025-03-03 14:26:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:38,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-03-03 14:26:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:39,145 INFO L225 Difference]: With dead ends: 96170 [2025-03-03 14:26:39,145 INFO L226 Difference]: Without dead ends: 96043 [2025-03-03 14:26:39,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:39,209 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 83 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:39,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 844 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96043 states. [2025-03-03 14:26:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96043 to 96035. [2025-03-03 14:26:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96035 states, 80697 states have (on average 1.5869982775072184) internal successors, (128066), 80703 states have internal predecessors, (128066), 15316 states have call successors, (15316), 18 states have call predecessors, (15316), 21 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2025-03-03 14:26:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96035 states to 96035 states and 160889 transitions. [2025-03-03 14:26:43,125 INFO L78 Accepts]: Start accepts. Automaton has 96035 states and 160889 transitions. Word has length 117 [2025-03-03 14:26:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:43,126 INFO L471 AbstractCegarLoop]: Abstraction has 96035 states and 160889 transitions. [2025-03-03 14:26:43,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:26:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 96035 states and 160889 transitions. [2025-03-03 14:26:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:26:43,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:43,147 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] [2025-03-03 14:26:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:26:43,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash -71645561, now seen corresponding path program 1 times [2025-03-03 14:26:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473534949] [2025-03-03 14:26:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:43,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:26:43,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:26:43,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:43,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:43,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473534949] [2025-03-03 14:26:43,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473534949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:43,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:43,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:26:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978091793] [2025-03-03 14:26:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:43,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:26:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:43,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:26:43,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:26:43,418 INFO L87 Difference]: Start difference. First operand 96035 states and 160889 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:26:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:47,776 INFO L93 Difference]: Finished difference Result 191376 states and 326114 transitions. [2025-03-03 14:26:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:26:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 118 [2025-03-03 14:26:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:48,682 INFO L225 Difference]: With dead ends: 191376 [2025-03-03 14:26:48,682 INFO L226 Difference]: Without dead ends: 191255 [2025-03-03 14:26:48,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:26:48,743 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1014 mSDsluCounter, 4551 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:48,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 5090 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:26:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191255 states. [2025-03-03 14:26:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191255 to 191218. [2025-03-03 14:26:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191218 states, 160750 states have (on average 1.587931570762053) internal successors, (255260), 160652 states have internal predecessors, (255260), 30417 states have call successors, (30417), 44 states have call predecessors, (30417), 50 states have return successors, (38070), 30527 states have call predecessors, (38070), 30414 states have call successors, (38070) [2025-03-03 14:26:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191218 states to 191218 states and 323747 transitions. [2025-03-03 14:26:55,453 INFO L78 Accepts]: Start accepts. Automaton has 191218 states and 323747 transitions. Word has length 118 [2025-03-03 14:26:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:55,454 INFO L471 AbstractCegarLoop]: Abstraction has 191218 states and 323747 transitions. [2025-03-03 14:26:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:26:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 191218 states and 323747 transitions. [2025-03-03 14:26:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:26:55,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:55,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:26:55,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1689887644, now seen corresponding path program 1 times [2025-03-03 14:26:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646513701] [2025-03-03 14:26:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:26:55,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:26:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646513701] [2025-03-03 14:26:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646513701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:55,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136200689] [2025-03-03 14:26:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:55,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:55,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:55,603 INFO L87 Difference]: Start difference. First operand 191218 states and 323747 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)