./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:29:46,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:29:46,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:29:46,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:29:46,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:29:46,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:29:46,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:29:46,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:29:46,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:29:46,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:29:46,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:29:46,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:29:46,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:29:46,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:29:46,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:29:46,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:29:46,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:29:46,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:29:46,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:29:46,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:29:46,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:29:46,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:29:46,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:29:46,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:29:46,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:29:46,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:29:46,237 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-jdk21/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 -> 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da [2024-11-06 23:29:46,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:29:46,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:29:46,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:29:46,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:29:46,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:29:46,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2024-11-06 23:29:47,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:29:47,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:29:47,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2024-11-06 23:29:47,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/897cd8482/c064e121bbd54410ad4eb343288748ee/FLAGfec67bb85 [2024-11-06 23:29:47,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/897cd8482/c064e121bbd54410ad4eb343288748ee [2024-11-06 23:29:47,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:29:47,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:29:47,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:29:47,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:29:47,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:29:47,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:29:47" (1/1) ... [2024-11-06 23:29:47,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d62c250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:47, skipping insertion in model container [2024-11-06 23:29:47,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:29:47" (1/1) ... [2024-11-06 23:29:48,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:29:48,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2024-11-06 23:29:48,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:29:48,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:29:48,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-06 23:29:48,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [269] [2024-11-06 23:29:48,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [318] [2024-11-06 23:29:48,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [598] [2024-11-06 23:29:48,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1671] [2024-11-06 23:29:48,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1906] [2024-11-06 23:29:48,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2312] [2024-11-06 23:29:48,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2329] [2024-11-06 23:29:48,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2695] [2024-11-06 23:29:48,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2704] [2024-11-06 23:29:48,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2808] [2024-11-06 23:29:48,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2024-11-06 23:29:48,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:29:48,476 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:29:48,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48 WrapperNode [2024-11-06 23:29:48,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:29:48,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:29:48,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:29:48,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:29:48,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,525 INFO L138 Inliner]: procedures = 122, calls = 174, calls flagged for inlining = 50, calls inlined = 40, statements flattened = 826 [2024-11-06 23:29:48,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:29:48,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:29:48,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:29:48,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:29:48,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,568 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]. [2024-11-06 23:29:48,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:29:48,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:29:48,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:29:48,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:29:48,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (1/1) ... [2024-11-06 23:29:48,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:29:48,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:48,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:29:48,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:29:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-06 23:29:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-06 23:29:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-06 23:29:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-06 23:29:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-06 23:29:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-06 23:29:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-06 23:29:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-06 23:29:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-06 23:29:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-06 23:29:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-06 23:29:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-06 23:29:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-06 23:29:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-06 23:29:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-06 23:29:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-06 23:29:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:29:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-06 23:29:48,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-06 23:29:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-06 23:29:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-06 23:29:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-06 23:29:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-06 23:29:48,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-06 23:29:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:29:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 23:29:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 23:29:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-06 23:29:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-06 23:29:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-06 23:29:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:29:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:29:48,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:29:48,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:29:49,502 INFO L? ?]: Removed 336 outVars from TransFormulas that were not future-live. [2024-11-06 23:29:49,502 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:29:49,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:29:49,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 23:29:49,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:29:49 BoogieIcfgContainer [2024-11-06 23:29:49,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:29:49,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:29:49,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:29:49,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:29:49,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:29:47" (1/3) ... [2024-11-06 23:29:49,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb03569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:29:49, skipping insertion in model container [2024-11-06 23:29:49,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:29:48" (2/3) ... [2024-11-06 23:29:49,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb03569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:29:49, skipping insertion in model container [2024-11-06 23:29:49,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:29:49" (3/3) ... [2024-11-06 23:29:49,526 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2024-11-06 23:29:49,536 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:29:49,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:29:49,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:29:49,598 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;@62268942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:29:49,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:29:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 205 states have (on average 1.5560975609756098) internal successors, (319), 209 states have internal predecessors, (319), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-06 23:29:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-06 23:29:49,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:49,616 INFO L215 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] [2024-11-06 23:29:49,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:49,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash -624496629, now seen corresponding path program 1 times [2024-11-06 23:29:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769488257] [2024-11-06 23:29:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:29:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:29:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:29:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-06 23:29:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 23:29:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:29:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-06 23:29:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 23:29:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769488257] [2024-11-06 23:29:50,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769488257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:50,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144146502] [2024-11-06 23:29:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:50,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:50,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 23:29:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:50,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 23:29:50,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 23:29:50,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:29:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144146502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:29:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-06 23:29:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175974797] [2024-11-06 23:29:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 23:29:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 23:29:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:29:50,568 INFO L87 Difference]: Start difference. First operand has 261 states, 205 states have (on average 1.5560975609756098) internal successors, (319), 209 states have internal predecessors, (319), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:50,594 INFO L93 Difference]: Finished difference Result 373 states and 556 transitions. [2024-11-06 23:29:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 23:29:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2024-11-06 23:29:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:50,602 INFO L225 Difference]: With dead ends: 373 [2024-11-06 23:29:50,602 INFO L226 Difference]: Without dead ends: 254 [2024-11-06 23:29:50,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:29:50,607 INFO L432 NwaCegarLoop]: 393 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, 393 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 [2024-11-06 23:29:50,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:29:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-06 23:29:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-06 23:29:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-06 23:29:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2024-11-06 23:29:50,642 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2024-11-06 23:29:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:50,643 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2024-11-06 23:29:50,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2024-11-06 23:29:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-06 23:29:50,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:50,647 INFO L215 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] [2024-11-06 23:29:50,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 23:29:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-06 23:29:50,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:50,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 434501306, now seen corresponding path program 1 times [2024-11-06 23:29:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143806580] [2024-11-06 23:29:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:29:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:29:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:29:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 23:29:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:29:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:29:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:29:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 23:29:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143806580] [2024-11-06 23:29:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143806580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011876721] [2024-11-06 23:29:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:51,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:51,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:51,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 23:29:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 23:29:51,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 23:29:51,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:29:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011876721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:51,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:29:51,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-06 23:29:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313947476] [2024-11-06 23:29:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:29:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:29:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:29:51,419 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:51,469 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2024-11-06 23:29:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:29:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2024-11-06 23:29:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:51,472 INFO L225 Difference]: With dead ends: 363 [2024-11-06 23:29:51,474 INFO L226 Difference]: Without dead ends: 257 [2024-11-06 23:29:51,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:29:51,477 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 1 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:29:51,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 764 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:29:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-06 23:29:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2024-11-06 23:29:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5422885572139304) internal successors, (310), 204 states have internal predecessors, (310), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-06 23:29:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2024-11-06 23:29:51,499 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 87 [2024-11-06 23:29:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:51,500 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2024-11-06 23:29:51,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2024-11-06 23:29:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 23:29:51,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:51,505 INFO L215 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] [2024-11-06 23:29:51,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 23:29:51,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:51,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2121837743, now seen corresponding path program 1 times [2024-11-06 23:29:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400616194] [2024-11-06 23:29:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:29:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:29:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:29:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-06 23:29:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-06 23:29:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-06 23:29:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:29:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 23:29:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400616194] [2024-11-06 23:29:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400616194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448504424] [2024-11-06 23:29:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:51,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:51,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 23:29:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:29:52,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 23:29:52,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:29:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448504424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:29:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-06 23:29:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102281597] [2024-11-06 23:29:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:29:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:29:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:29:52,176 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:52,207 INFO L93 Difference]: Finished difference Result 537 states and 825 transitions. [2024-11-06 23:29:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:29:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-11-06 23:29:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:52,210 INFO L225 Difference]: With dead ends: 537 [2024-11-06 23:29:52,210 INFO L226 Difference]: Without dead ends: 308 [2024-11-06 23:29:52,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:29:52,211 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 731 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 [2024-11-06 23:29:52,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 731 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:29:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-06 23:29:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2024-11-06 23:29:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 237 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-06 23:29:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 463 transitions. [2024-11-06 23:29:52,226 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 463 transitions. Word has length 93 [2024-11-06 23:29:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:52,227 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 463 transitions. [2024-11-06 23:29:52,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:29:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 463 transitions. [2024-11-06 23:29:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-06 23:29:52,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:52,229 INFO L215 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] [2024-11-06 23:29:52,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 23:29:52,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:52,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:52,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2132692778, now seen corresponding path program 1 times [2024-11-06 23:29:52,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:52,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35270689] [2024-11-06 23:29:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:29:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:29:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:29:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-06 23:29:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-06 23:29:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:29:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:29:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 23:29:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35270689] [2024-11-06 23:29:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35270689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209060804] [2024-11-06 23:29:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:52,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:52,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:52,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 23:29:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:52,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 23:29:52,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 23:29:52,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:29:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209060804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:29:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-06 23:29:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387596878] [2024-11-06 23:29:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:29:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:29:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:29:52,928 INFO L87 Difference]: Start difference. First operand 300 states and 463 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:52,981 INFO L93 Difference]: Finished difference Result 591 states and 916 transitions. [2024-11-06 23:29:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:29:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2024-11-06 23:29:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:52,984 INFO L225 Difference]: With dead ends: 591 [2024-11-06 23:29:52,984 INFO L226 Difference]: Without dead ends: 302 [2024-11-06 23:29:52,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:29:52,985 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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 [2024-11-06 23:29:52,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:29:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-06 23:29:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-06 23:29:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 235 states have (on average 1.553191489361702) internal successors, (365), 239 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2024-11-06 23:29:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 466 transitions. [2024-11-06 23:29:53,010 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 466 transitions. Word has length 94 [2024-11-06 23:29:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 466 transitions. [2024-11-06 23:29:53,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 466 transitions. [2024-11-06 23:29:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-06 23:29:53,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:53,016 INFO L215 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] [2024-11-06 23:29:53,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 23:29:53,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:53,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:53,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1205446056, now seen corresponding path program 1 times [2024-11-06 23:29:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670518996] [2024-11-06 23:29:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:29:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:29:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 23:29:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 23:29:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-06 23:29:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-06 23:29:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 23:29:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670518996] [2024-11-06 23:29:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670518996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601698181] [2024-11-06 23:29:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:53,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:53,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:53,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 23:29:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:53,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 23:29:53,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 23:29:53,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:29:53,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601698181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:53,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:29:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-06 23:29:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3967837] [2024-11-06 23:29:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:53,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:29:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:53,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:29:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:29:53,651 INFO L87 Difference]: Start difference. First operand 302 states and 466 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:53,707 INFO L93 Difference]: Finished difference Result 593 states and 921 transitions. [2024-11-06 23:29:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:29:53,708 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2024-11-06 23:29:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:53,710 INFO L225 Difference]: With dead ends: 593 [2024-11-06 23:29:53,710 INFO L226 Difference]: Without dead ends: 304 [2024-11-06 23:29:53,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:29:53,715 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 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 [2024-11-06 23:29:53,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:29:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-06 23:29:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-06 23:29:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 241 states have internal predecessors, (366), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-11-06 23:29:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 472 transitions. [2024-11-06 23:29:53,726 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 472 transitions. Word has length 95 [2024-11-06 23:29:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:53,727 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 472 transitions. [2024-11-06 23:29:53,727 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 472 transitions. [2024-11-06 23:29:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 23:29:53,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:53,728 INFO L215 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] [2024-11-06 23:29:53,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 23:29:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:53,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash 658475617, now seen corresponding path program 1 times [2024-11-06 23:29:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573813489] [2024-11-06 23:29:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:29:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:29:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-06 23:29:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:29:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-06 23:29:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:29:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 23:29:54,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573813489] [2024-11-06 23:29:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573813489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:29:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:29:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281578508] [2024-11-06 23:29:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:54,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:29:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:54,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:29:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:29:54,065 INFO L87 Difference]: Start difference. First operand 304 states and 472 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:54,993 INFO L93 Difference]: Finished difference Result 637 states and 995 transitions. [2024-11-06 23:29:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:29:54,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2024-11-06 23:29:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:54,996 INFO L225 Difference]: With dead ends: 637 [2024-11-06 23:29:54,996 INFO L226 Difference]: Without dead ends: 356 [2024-11-06 23:29:54,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:29:54,997 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 569 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:29:54,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 926 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:29:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-06 23:29:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2024-11-06 23:29:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 241 states have internal predecessors, (366), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2024-11-06 23:29:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 471 transitions. [2024-11-06 23:29:55,016 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 471 transitions. Word has length 96 [2024-11-06 23:29:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 471 transitions. [2024-11-06 23:29:55,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 471 transitions. [2024-11-06 23:29:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-06 23:29:55,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:55,018 INFO L215 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] [2024-11-06 23:29:55,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:29:55,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:55,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1219216955, now seen corresponding path program 2 times [2024-11-06 23:29:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238296679] [2024-11-06 23:29:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:29:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:29:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 23:29:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:29:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 23:29:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-06 23:29:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 23:29:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238296679] [2024-11-06 23:29:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238296679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:55,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:29:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:29:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159210729] [2024-11-06 23:29:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:29:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:29:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:29:55,164 INFO L87 Difference]: Start difference. First operand 304 states and 471 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:56,050 INFO L93 Difference]: Finished difference Result 639 states and 998 transitions. [2024-11-06 23:29:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:29:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2024-11-06 23:29:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:56,053 INFO L225 Difference]: With dead ends: 639 [2024-11-06 23:29:56,053 INFO L226 Difference]: Without dead ends: 358 [2024-11-06 23:29:56,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:29:56,055 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 566 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:29:56,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 926 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:29:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-06 23:29:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2024-11-06 23:29:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 243 states have internal predecessors, (367), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (57), 49 states have call predecessors, (57), 49 states have call successors, (57) [2024-11-06 23:29:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 474 transitions. [2024-11-06 23:29:56,079 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 474 transitions. Word has length 97 [2024-11-06 23:29:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:56,079 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 474 transitions. [2024-11-06 23:29:56,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:29:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 474 transitions. [2024-11-06 23:29:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 23:29:56,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:56,081 INFO L215 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] [2024-11-06 23:29:56,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:29:56,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:56,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 252552444, now seen corresponding path program 1 times [2024-11-06 23:29:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682075654] [2024-11-06 23:29:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:29:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:29:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:29:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-06 23:29:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-06 23:29:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:29:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 23:29:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682075654] [2024-11-06 23:29:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682075654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:29:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:29:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438767] [2024-11-06 23:29:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:29:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:29:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:29:56,237 INFO L87 Difference]: Start difference. First operand 306 states and 474 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-06 23:29:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:57,434 INFO L93 Difference]: Finished difference Result 637 states and 993 transitions. [2024-11-06 23:29:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:29:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 98 [2024-11-06 23:29:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:57,437 INFO L225 Difference]: With dead ends: 637 [2024-11-06 23:29:57,437 INFO L226 Difference]: Without dead ends: 358 [2024-11-06 23:29:57,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-06 23:29:57,438 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 569 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:29:57,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1329 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:29:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-06 23:29:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2024-11-06 23:29:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 243 states have internal predecessors, (367), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-11-06 23:29:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 473 transitions. [2024-11-06 23:29:57,456 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 473 transitions. Word has length 98 [2024-11-06 23:29:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:57,456 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 473 transitions. [2024-11-06 23:29:57,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-06 23:29:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 473 transitions. [2024-11-06 23:29:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 23:29:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:57,458 INFO L215 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] [2024-11-06 23:29:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:29:57,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -320628967, now seen corresponding path program 2 times [2024-11-06 23:29:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029589945] [2024-11-06 23:29:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:29:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:29:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-06 23:29:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:29:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:29:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 23:29:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 23:29:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029589945] [2024-11-06 23:29:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029589945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:29:57,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:29:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:29:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879926997] [2024-11-06 23:29:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:29:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:29:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:29:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:29:57,620 INFO L87 Difference]: Start difference. First operand 306 states and 473 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-06 23:29:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:29:58,920 INFO L93 Difference]: Finished difference Result 639 states and 999 transitions. [2024-11-06 23:29:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:29:58,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2024-11-06 23:29:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:29:58,923 INFO L225 Difference]: With dead ends: 639 [2024-11-06 23:29:58,923 INFO L226 Difference]: Without dead ends: 360 [2024-11-06 23:29:58,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-06 23:29:58,926 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 566 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:29:58,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1330 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:29:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-06 23:29:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2024-11-06 23:29:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.546218487394958) internal successors, (368), 245 states have internal predecessors, (368), 50 states have call successors, (50), 15 states have call predecessors, (50), 19 states have return successors, (61), 49 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-06 23:29:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 479 transitions. [2024-11-06 23:29:58,946 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 479 transitions. Word has length 99 [2024-11-06 23:29:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:29:58,947 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 479 transitions. [2024-11-06 23:29:58,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-06 23:29:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 479 transitions. [2024-11-06 23:29:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:29:58,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:29:58,950 INFO L215 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] [2024-11-06 23:29:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:29:58,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:29:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:29:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash -807696649, now seen corresponding path program 1 times [2024-11-06 23:29:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:29:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387493274] [2024-11-06 23:29:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:29:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:29:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:29:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:29:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:29:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:29:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:29:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 23:29:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:29:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:29:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-06 23:29:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:29:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:29:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387493274] [2024-11-06 23:29:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387493274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:29:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242166559] [2024-11-06 23:29:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:29:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:29:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:29:59,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:29:59,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 23:29:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:29:59,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:29:59,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:29:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:29:59,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:29:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:29:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242166559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:29:59,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:29:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-06 23:29:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70702034] [2024-11-06 23:29:59,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:29:59,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 23:29:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:29:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 23:29:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:29:59,368 INFO L87 Difference]: Start difference. First operand 308 states and 479 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-06 23:30:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:00,327 INFO L93 Difference]: Finished difference Result 793 states and 1297 transitions. [2024-11-06 23:30:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:30:00,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2024-11-06 23:30:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:00,333 INFO L225 Difference]: With dead ends: 793 [2024-11-06 23:30:00,333 INFO L226 Difference]: Without dead ends: 687 [2024-11-06 23:30:00,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:30:00,335 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 940 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:00,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1127 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:30:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-06 23:30:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 611. [2024-11-06 23:30:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 477 states have (on average 1.6058700209643606) internal successors, (766), 484 states have internal predecessors, (766), 114 states have call successors, (114), 15 states have call predecessors, (114), 19 states have return successors, (135), 113 states have call predecessors, (135), 113 states have call successors, (135) [2024-11-06 23:30:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1015 transitions. [2024-11-06 23:30:00,383 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1015 transitions. Word has length 100 [2024-11-06 23:30:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:00,384 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1015 transitions. [2024-11-06 23:30:00,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-06 23:30:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1015 transitions. [2024-11-06 23:30:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-06 23:30:00,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:00,387 INFO L215 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] [2024-11-06 23:30:00,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-06 23:30:00,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 23:30:00,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:00,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash -699793798, now seen corresponding path program 1 times [2024-11-06 23:30:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:00,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792857710] [2024-11-06 23:30:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 23:30:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-06 23:30:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 23:30:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 23:30:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792857710] [2024-11-06 23:30:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792857710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128568600] [2024-11-06 23:30:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:00,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:00,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:00,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:00,694 INFO L87 Difference]: Start difference. First operand 611 states and 1015 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:01,365 INFO L93 Difference]: Finished difference Result 1514 states and 2576 transitions. [2024-11-06 23:30:01,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-06 23:30:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:01,371 INFO L225 Difference]: With dead ends: 1514 [2024-11-06 23:30:01,371 INFO L226 Difference]: Without dead ends: 971 [2024-11-06 23:30:01,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:01,374 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 662 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:01,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 704 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-06 23:30:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 911. [2024-11-06 23:30:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.614305750350631) internal successors, (1151), 720 states have internal predecessors, (1151), 178 states have call successors, (178), 15 states have call predecessors, (178), 19 states have return successors, (209), 177 states have call predecessors, (209), 177 states have call successors, (209) [2024-11-06 23:30:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1538 transitions. [2024-11-06 23:30:01,412 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1538 transitions. Word has length 106 [2024-11-06 23:30:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1538 transitions. [2024-11-06 23:30:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1538 transitions. [2024-11-06 23:30:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 23:30:01,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:01,416 INFO L215 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] [2024-11-06 23:30:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:30:01,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:01,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1925218256, now seen corresponding path program 1 times [2024-11-06 23:30:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596392954] [2024-11-06 23:30:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:30:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:30:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-06 23:30:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-06 23:30:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596392954] [2024-11-06 23:30:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596392954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271695416] [2024-11-06 23:30:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:01,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:01,506 INFO L87 Difference]: Start difference. First operand 911 states and 1538 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:02,236 INFO L93 Difference]: Finished difference Result 2229 states and 3821 transitions. [2024-11-06 23:30:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:02,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-11-06 23:30:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:02,244 INFO L225 Difference]: With dead ends: 2229 [2024-11-06 23:30:02,244 INFO L226 Difference]: Without dead ends: 1439 [2024-11-06 23:30:02,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:02,248 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 660 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:02,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 648 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-11-06 23:30:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1379. [2024-11-06 23:30:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1086 states have (on average 1.6187845303867403) internal successors, (1758), 1093 states have internal predecessors, (1758), 273 states have call successors, (273), 15 states have call predecessors, (273), 19 states have return successors, (304), 272 states have call predecessors, (304), 272 states have call successors, (304) [2024-11-06 23:30:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2335 transitions. [2024-11-06 23:30:02,300 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2335 transitions. Word has length 107 [2024-11-06 23:30:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:02,301 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2335 transitions. [2024-11-06 23:30:02,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2335 transitions. [2024-11-06 23:30:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 23:30:02,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:02,306 INFO L215 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] [2024-11-06 23:30:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 23:30:02,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1161467032, now seen corresponding path program 1 times [2024-11-06 23:30:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880030299] [2024-11-06 23:30:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:30:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-06 23:30:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 23:30:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-06 23:30:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880030299] [2024-11-06 23:30:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880030299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:02,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502685448] [2024-11-06 23:30:02,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:02,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:02,375 INFO L87 Difference]: Start difference. First operand 1379 states and 2335 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:03,068 INFO L93 Difference]: Finished difference Result 3276 states and 5662 transitions. [2024-11-06 23:30:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-11-06 23:30:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:03,079 INFO L225 Difference]: With dead ends: 3276 [2024-11-06 23:30:03,079 INFO L226 Difference]: Without dead ends: 2143 [2024-11-06 23:30:03,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:03,083 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 658 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:03,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 647 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2024-11-06 23:30:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2083. [2024-11-06 23:30:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1667 states have (on average 1.6226754649070185) internal successors, (2705), 1674 states have internal predecessors, (2705), 396 states have call successors, (396), 15 states have call predecessors, (396), 19 states have return successors, (443), 395 states have call predecessors, (443), 395 states have call successors, (443) [2024-11-06 23:30:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3544 transitions. [2024-11-06 23:30:03,152 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3544 transitions. Word has length 108 [2024-11-06 23:30:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:03,153 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3544 transitions. [2024-11-06 23:30:03,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3544 transitions. [2024-11-06 23:30:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-06 23:30:03,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:03,158 INFO L215 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] [2024-11-06 23:30:03,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 23:30:03,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1105028913, now seen corresponding path program 1 times [2024-11-06 23:30:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31925037] [2024-11-06 23:30:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-06 23:30:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-06 23:30:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-06 23:30:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 23:30:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31925037] [2024-11-06 23:30:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31925037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:03,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:03,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123377745] [2024-11-06 23:30:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:03,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:03,248 INFO L87 Difference]: Start difference. First operand 2083 states and 3544 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:03,916 INFO L93 Difference]: Finished difference Result 4895 states and 8516 transitions. [2024-11-06 23:30:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2024-11-06 23:30:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:03,932 INFO L225 Difference]: With dead ends: 4895 [2024-11-06 23:30:03,932 INFO L226 Difference]: Without dead ends: 3262 [2024-11-06 23:30:03,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:03,939 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 656 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:03,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 646 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-11-06 23:30:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3202. [2024-11-06 23:30:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 2607 states have (on average 1.624856156501726) internal successors, (4236), 2614 states have internal predecessors, (4236), 575 states have call successors, (575), 15 states have call predecessors, (575), 19 states have return successors, (648), 574 states have call predecessors, (648), 574 states have call successors, (648) [2024-11-06 23:30:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5459 transitions. [2024-11-06 23:30:04,089 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5459 transitions. Word has length 109 [2024-11-06 23:30:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5459 transitions. [2024-11-06 23:30:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5459 transitions. [2024-11-06 23:30:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-06 23:30:04,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:04,097 INFO L215 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] [2024-11-06 23:30:04,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 23:30:04,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:04,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1327662884, now seen corresponding path program 1 times [2024-11-06 23:30:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059673730] [2024-11-06 23:30:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:30:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 23:30:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:30:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-06 23:30:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059673730] [2024-11-06 23:30:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059673730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693278545] [2024-11-06 23:30:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:04,174 INFO L87 Difference]: Start difference. First operand 3202 states and 5459 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:04,884 INFO L93 Difference]: Finished difference Result 7813 states and 13615 transitions. [2024-11-06 23:30:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2024-11-06 23:30:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:04,907 INFO L225 Difference]: With dead ends: 7813 [2024-11-06 23:30:04,907 INFO L226 Difference]: Without dead ends: 5293 [2024-11-06 23:30:04,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:04,914 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 654 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:04,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 677 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2024-11-06 23:30:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5233. [2024-11-06 23:30:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 4262 states have (on average 1.616142656030033) internal successors, (6888), 4269 states have internal predecessors, (6888), 951 states have call successors, (951), 15 states have call predecessors, (951), 19 states have return successors, (1068), 950 states have call predecessors, (1068), 950 states have call successors, (1068) [2024-11-06 23:30:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 8907 transitions. [2024-11-06 23:30:05,083 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 8907 transitions. Word has length 110 [2024-11-06 23:30:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:05,083 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 8907 transitions. [2024-11-06 23:30:05,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 8907 transitions. [2024-11-06 23:30:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:30:05,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:05,093 INFO L215 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] [2024-11-06 23:30:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 23:30:05,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1675034485, now seen corresponding path program 1 times [2024-11-06 23:30:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872277730] [2024-11-06 23:30:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:30:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-06 23:30:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 23:30:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 23:30:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872277730] [2024-11-06 23:30:05,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872277730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:05,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:05,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365043693] [2024-11-06 23:30:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:05,162 INFO L87 Difference]: Start difference. First operand 5233 states and 8907 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:05,977 INFO L93 Difference]: Finished difference Result 12955 states and 22524 transitions. [2024-11-06 23:30:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2024-11-06 23:30:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:06,016 INFO L225 Difference]: With dead ends: 12955 [2024-11-06 23:30:06,016 INFO L226 Difference]: Without dead ends: 8781 [2024-11-06 23:30:06,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:06,025 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 652 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:06,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 648 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8781 states. [2024-11-06 23:30:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8781 to 8721. [2024-11-06 23:30:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8721 states, 7144 states have (on average 1.6128219484882418) internal successors, (11522), 7151 states have internal predecessors, (11522), 1557 states have call successors, (1557), 15 states have call predecessors, (1557), 19 states have return successors, (1752), 1556 states have call predecessors, (1752), 1556 states have call successors, (1752) [2024-11-06 23:30:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 14831 transitions. [2024-11-06 23:30:06,439 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 14831 transitions. Word has length 111 [2024-11-06 23:30:06,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:06,440 INFO L471 AbstractCegarLoop]: Abstraction has 8721 states and 14831 transitions. [2024-11-06 23:30:06,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 14831 transitions. [2024-11-06 23:30:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:30:06,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:06,469 INFO L215 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] [2024-11-06 23:30:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 23:30:06,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:06,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1253521690, now seen corresponding path program 1 times [2024-11-06 23:30:06,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873744994] [2024-11-06 23:30:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 23:30:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:30:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:30:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-06 23:30:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873744994] [2024-11-06 23:30:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873744994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428988280] [2024-11-06 23:30:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:06,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:06,634 INFO L87 Difference]: Start difference. First operand 8721 states and 14831 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:07,614 INFO L93 Difference]: Finished difference Result 22614 states and 39230 transitions. [2024-11-06 23:30:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-06 23:30:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:07,663 INFO L225 Difference]: With dead ends: 22614 [2024-11-06 23:30:07,664 INFO L226 Difference]: Without dead ends: 15374 [2024-11-06 23:30:07,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:07,683 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 650 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:07,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 702 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15374 states. [2024-11-06 23:30:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15374 to 15314. [2024-11-06 23:30:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15314 states, 12534 states have (on average 1.6026807084729535) internal successors, (20088), 12541 states have internal predecessors, (20088), 2760 states have call successors, (2760), 15 states have call predecessors, (2760), 19 states have return successors, (3099), 2759 states have call predecessors, (3099), 2759 states have call successors, (3099) [2024-11-06 23:30:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 25947 transitions. [2024-11-06 23:30:08,133 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 25947 transitions. Word has length 112 [2024-11-06 23:30:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:08,134 INFO L471 AbstractCegarLoop]: Abstraction has 15314 states and 25947 transitions. [2024-11-06 23:30:08,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 25947 transitions. [2024-11-06 23:30:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-06 23:30:08,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:08,149 INFO L215 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] [2024-11-06 23:30:08,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 23:30:08,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -208311830, now seen corresponding path program 1 times [2024-11-06 23:30:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60445472] [2024-11-06 23:30:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-06 23:30:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:30:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 23:30:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-06 23:30:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:08,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60445472] [2024-11-06 23:30:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60445472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130712673] [2024-11-06 23:30:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:08,220 INFO L87 Difference]: Start difference. First operand 15314 states and 25947 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:09,360 INFO L93 Difference]: Finished difference Result 40570 states and 70213 transitions. [2024-11-06 23:30:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2024-11-06 23:30:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:09,465 INFO L225 Difference]: With dead ends: 40570 [2024-11-06 23:30:09,466 INFO L226 Difference]: Without dead ends: 27344 [2024-11-06 23:30:09,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:09,504 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 648 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:09,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 648 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:30:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27344 states. [2024-11-06 23:30:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27344 to 27284. [2024-11-06 23:30:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27284 states, 22465 states have (on average 1.5978633429779656) internal successors, (35896), 22472 states have internal predecessors, (35896), 4799 states have call successors, (4799), 15 states have call predecessors, (4799), 19 states have return successors, (5412), 4798 states have call predecessors, (5412), 4798 states have call successors, (5412) [2024-11-06 23:30:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27284 states to 27284 states and 46107 transitions. [2024-11-06 23:30:10,455 INFO L78 Accepts]: Start accepts. Automaton has 27284 states and 46107 transitions. Word has length 113 [2024-11-06 23:30:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 27284 states and 46107 transitions. [2024-11-06 23:30:10,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27284 states and 46107 transitions. [2024-11-06 23:30:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 23:30:10,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:10,472 INFO L215 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] [2024-11-06 23:30:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 23:30:10,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:10,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1420893432, now seen corresponding path program 1 times [2024-11-06 23:30:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608630572] [2024-11-06 23:30:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-06 23:30:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:30:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-06 23:30:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-06 23:30:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608630572] [2024-11-06 23:30:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608630572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069443945] [2024-11-06 23:30:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:10,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:10,538 INFO L87 Difference]: Start difference. First operand 27284 states and 46107 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:11,840 INFO L93 Difference]: Finished difference Result 74357 states and 127812 transitions. [2024-11-06 23:30:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:11,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2024-11-06 23:30:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:12,249 INFO L225 Difference]: With dead ends: 74357 [2024-11-06 23:30:12,250 INFO L226 Difference]: Without dead ends: 49893 [2024-11-06 23:30:12,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:12,295 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 646 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:12,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 656 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 23:30:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49893 states. [2024-11-06 23:30:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49893 to 49833. [2024-11-06 23:30:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49833 states, 41299 states have (on average 1.5917334560158842) internal successors, (65737), 41306 states have internal predecessors, (65737), 8514 states have call successors, (8514), 15 states have call predecessors, (8514), 19 states have return successors, (9659), 8513 states have call predecessors, (9659), 8513 states have call successors, (9659) [2024-11-06 23:30:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49833 states to 49833 states and 83910 transitions. [2024-11-06 23:30:14,009 INFO L78 Accepts]: Start accepts. Automaton has 49833 states and 83910 transitions. Word has length 114 [2024-11-06 23:30:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 49833 states and 83910 transitions. [2024-11-06 23:30:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 49833 states and 83910 transitions. [2024-11-06 23:30:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 23:30:14,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:14,032 INFO L215 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] [2024-11-06 23:30:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 23:30:14,032 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1196910922, now seen corresponding path program 1 times [2024-11-06 23:30:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268754550] [2024-11-06 23:30:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:30:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-06 23:30:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-06 23:30:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-06 23:30:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268754550] [2024-11-06 23:30:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268754550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350657348] [2024-11-06 23:30:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:14,142 INFO L87 Difference]: Start difference. First operand 49833 states and 83910 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:16,400 INFO L93 Difference]: Finished difference Result 92843 states and 159943 transitions. [2024-11-06 23:30:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 115 [2024-11-06 23:30:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:17,073 INFO L225 Difference]: With dead ends: 92843 [2024-11-06 23:30:17,073 INFO L226 Difference]: Without dead ends: 92737 [2024-11-06 23:30:17,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:17,166 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 641 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:17,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 679 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:30:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92737 states. [2024-11-06 23:30:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92737 to 92677. [2024-11-06 23:30:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92677 states, 77344 states have (on average 1.584130637153496) internal successors, (122523), 77351 states have internal predecessors, (122523), 15313 states have call successors, (15313), 15 states have call predecessors, (15313), 19 states have return successors, (17504), 15312 states have call predecessors, (17504), 15312 states have call successors, (17504) [2024-11-06 23:30:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92677 states to 92677 states and 155340 transitions. [2024-11-06 23:30:20,236 INFO L78 Accepts]: Start accepts. Automaton has 92677 states and 155340 transitions. Word has length 115 [2024-11-06 23:30:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:20,236 INFO L471 AbstractCegarLoop]: Abstraction has 92677 states and 155340 transitions. [2024-11-06 23:30:20,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:30:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 92677 states and 155340 transitions. [2024-11-06 23:30:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 23:30:20,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:20,767 INFO L215 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] [2024-11-06 23:30:20,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 23:30:20,768 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash -216688615, now seen corresponding path program 1 times [2024-11-06 23:30:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029970728] [2024-11-06 23:30:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:30:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:30:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 23:30:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-06 23:30:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029970728] [2024-11-06 23:30:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029970728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-06 23:30:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728004356] [2024-11-06 23:30:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:21,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 23:30:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:21,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 23:30:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:30:21,109 INFO L87 Difference]: Start difference. First operand 92677 states and 155340 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 23:30:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:27,021 INFO L93 Difference]: Finished difference Result 184815 states and 321750 transitions. [2024-11-06 23:30:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-06 23:30:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 116 [2024-11-06 23:30:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:28,024 INFO L225 Difference]: With dead ends: 184815 [2024-11-06 23:30:28,025 INFO L226 Difference]: Without dead ends: 184717 [2024-11-06 23:30:28,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1389, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 23:30:28,086 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 2375 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:28,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 2154 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 23:30:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184717 states. [2024-11-06 23:30:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184717 to 184539. [2024-11-06 23:30:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184539 states, 154086 states have (on average 1.5850888464883246) internal successors, (244240), 153988 states have internal predecessors, (244240), 30409 states have call successors, (30409), 38 states have call predecessors, (30409), 43 states have return successors, (38058), 30518 states have call predecessors, (38058), 30406 states have call successors, (38058) [2024-11-06 23:30:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184539 states to 184539 states and 312707 transitions. [2024-11-06 23:30:34,836 INFO L78 Accepts]: Start accepts. Automaton has 184539 states and 312707 transitions. Word has length 116 [2024-11-06 23:30:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 184539 states and 312707 transitions. [2024-11-06 23:30:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 23:30:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 184539 states and 312707 transitions. [2024-11-06 23:30:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 23:30:34,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:34,862 INFO L215 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] [2024-11-06 23:30:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 23:30:34,862 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:34,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1982536604, now seen corresponding path program 1 times [2024-11-06 23:30:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556037363] [2024-11-06 23:30:34,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:30:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:30:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-06 23:30:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-06 23:30:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:30:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556037363] [2024-11-06 23:30:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556037363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:30:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185513242] [2024-11-06 23:30:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:30:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:35,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:30:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:30:35,041 INFO L87 Difference]: Start difference. First operand 184539 states and 312707 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-06 23:30:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:39,768 INFO L93 Difference]: Finished difference Result 185232 states and 320226 transitions. [2024-11-06 23:30:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:30:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 117 [2024-11-06 23:30:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:40,488 INFO L225 Difference]: With dead ends: 185232 [2024-11-06 23:30:40,488 INFO L226 Difference]: Without dead ends: 184769 [2024-11-06 23:30:40,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-06 23:30:40,564 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1153 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:40,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1166 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 23:30:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184769 states.