./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product28.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_product28.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', '25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1'] 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_product28.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 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:30:05,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:30:05,942 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:30:05,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:30:05,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:30:05,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:30:05,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:30:05,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:30:05,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:30:05,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:30:05,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:30:05,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:30:05,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:30:05,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:30:05,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:30:05,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:30:05,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:30:05,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:30:05,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:30:05,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:30:05,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:30:05,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:30:05,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:30:05,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:30:05,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:30:05,981 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 -> 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 [2024-11-06 23:30:06,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:30:06,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:30:06,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:30:06,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:30:06,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:30:06,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-06 23:30:07,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:30:07,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:30:07,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-06 23:30:07,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a98352d01/645cdf5aa72a4287b032525f0699f113/FLAG30eacc756 [2024-11-06 23:30:08,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a98352d01/645cdf5aa72a4287b032525f0699f113 [2024-11-06 23:30:08,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:30:08,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:30:08,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:30:08,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:30:08,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:30:08,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3451630e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08, skipping insertion in model container [2024-11-06 23:30:08,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:30:08,606 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_product28.cil.c[51091,51104] [2024-11-06 23:30:08,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:30:08,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:30:08,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-06 23:30:08,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-06 23:30:08,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1494] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1512] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1561] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1592] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1739] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2019] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2232] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2241] [2024-11-06 23:30:08,673 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2643] [2024-11-06 23:30:08,758 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_product28.cil.c[51091,51104] [2024-11-06 23:30:08,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:30:08,807 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:30:08,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08 WrapperNode [2024-11-06 23:30:08,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:30:08,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:30:08,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:30:08,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:30:08,815 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:30:08" (1/1) ... [2024-11-06 23:30:08,841 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:30:08" (1/1) ... [2024-11-06 23:30:08,879 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-11-06 23:30:08,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:30:08,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:30:08,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:30:08,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:30:08,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,933 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:30:08,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:30:08,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:30:08,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:30:08,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:30:08,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (1/1) ... [2024-11-06 23:30:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:30:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:09,022 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:30:09,027 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:30:09,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-06 23:30:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-06 23:30:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-06 23:30:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-06 23:30:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-06 23:30:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-06 23:30:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-06 23:30:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-06 23:30:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-06 23:30:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-06 23:30:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-06 23:30:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-06 23:30:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-06 23:30:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-06 23:30:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-06 23:30:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-06 23:30:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-06 23:30:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-06 23:30:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-06 23:30:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:30:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 23:30:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 23:30:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-06 23:30:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-06 23:30:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-06 23:30:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:30:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:30:09,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:30:09,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:30:10,074 INFO L? ?]: Removed 398 outVars from TransFormulas that were not future-live. [2024-11-06 23:30:10,075 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:30:10,095 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:30:10,099 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 23:30:10,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:30:10 BoogieIcfgContainer [2024-11-06 23:30:10,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:30:10,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:30:10,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:30:10,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:30:10,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:30:08" (1/3) ... [2024-11-06 23:30:10,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:30:10, skipping insertion in model container [2024-11-06 23:30:10,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:30:08" (2/3) ... [2024-11-06 23:30:10,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:30:10, skipping insertion in model container [2024-11-06 23:30:10,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:30:10" (3/3) ... [2024-11-06 23:30:10,109 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2024-11-06 23:30:10,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:30:10,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:30:10,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:30:10,198 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;@10c07b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:30:10,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:30:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 253 states have (on average 1.5217391304347827) internal successors, (385), 257 states have internal predecessors, (385), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-06 23:30:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 23:30:10,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:10,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:10,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 610945282, now seen corresponding path program 1 times [2024-11-06 23:30:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159160078] [2024-11-06 23:30:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:30:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:30:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:30:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-06 23:30:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 23:30:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-06 23:30:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:30:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-06 23:30:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:30:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,036 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:30:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:11,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159160078] [2024-11-06 23:30:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159160078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589037936] [2024-11-06 23:30:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:11,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:11,043 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:30:11,046 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:30:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:11,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 23:30:11,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:11,412 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:30:11,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:30:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589037936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:11,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:30:11,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-06 23:30:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012960836] [2024-11-06 23:30:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 23:30:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:11,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 23:30:11,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:30:11,439 INFO L87 Difference]: Start difference. First operand has 327 states, 253 states have (on average 1.5217391304347827) internal successors, (385), 257 states have internal predecessors, (385), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:11,496 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2024-11-06 23:30:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 23:30:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-11-06 23:30:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:11,510 INFO L225 Difference]: With dead ends: 505 [2024-11-06 23:30:11,510 INFO L226 Difference]: Without dead ends: 320 [2024-11-06 23:30:11,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:30:11,519 INFO L432 NwaCegarLoop]: 481 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, 481 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:30:11,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:30:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-06 23:30:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-06 23:30:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 247 states have (on average 1.51417004048583) internal successors, (374), 250 states have internal predecessors, (374), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-06 23:30:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 473 transitions. [2024-11-06 23:30:11,575 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 473 transitions. Word has length 98 [2024-11-06 23:30:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:11,577 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 473 transitions. [2024-11-06 23:30:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 473 transitions. [2024-11-06 23:30:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 23:30:11,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:11,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:11,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 23:30:11,787 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:30:11,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2132313920, now seen corresponding path program 1 times [2024-11-06 23:30:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149015031] [2024-11-06 23:30:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:30:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:30:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:30:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 23:30:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:30:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 23:30:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 23:30:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:30:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 23:30:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,153 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:30:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149015031] [2024-11-06 23:30:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149015031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721679781] [2024-11-06 23:30:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:12,159 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:30:12,160 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:30:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:12,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 23:30:12,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:12,506 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:30:12,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:30:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721679781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:30:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-06 23:30:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389276738] [2024-11-06 23:30:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:12,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:30:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:30:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:30:12,508 INFO L87 Difference]: Start difference. First operand 320 states and 473 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:12,554 INFO L93 Difference]: Finished difference Result 495 states and 713 transitions. [2024-11-06 23:30:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:30:12,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-06 23:30:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:12,557 INFO L225 Difference]: With dead ends: 495 [2024-11-06 23:30:12,558 INFO L226 Difference]: Without dead ends: 323 [2024-11-06 23:30:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:30:12,560 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 1 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 940 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:30:12,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 940 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:30:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-06 23:30:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-06 23:30:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 252 states have internal predecessors, (376), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-06 23:30:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 475 transitions. [2024-11-06 23:30:12,601 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 475 transitions. Word has length 99 [2024-11-06 23:30:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:12,601 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 475 transitions. [2024-11-06 23:30:12,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 475 transitions. [2024-11-06 23:30:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-06 23:30:12,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:12,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:12,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 23:30:12,808 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:30:12,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2004971831, now seen corresponding path program 1 times [2024-11-06 23:30:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146252702] [2024-11-06 23:30:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:30:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:30:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:30:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-06 23:30:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-06 23:30:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 23:30:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:30:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:30:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:30:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,120 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:30:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146252702] [2024-11-06 23:30:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146252702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876541345] [2024-11-06 23:30:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:13,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:13,125 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:30:13,127 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:30:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:30:13,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:13,442 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:30:13,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:30:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876541345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:30:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-06 23:30:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705774372] [2024-11-06 23:30:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:13,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:30:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:30:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:30:13,445 INFO L87 Difference]: Start difference. First operand 322 states and 475 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:13,502 INFO L93 Difference]: Finished difference Result 669 states and 1001 transitions. [2024-11-06 23:30:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:30:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-06 23:30:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:13,507 INFO L225 Difference]: With dead ends: 669 [2024-11-06 23:30:13,508 INFO L226 Difference]: Without dead ends: 374 [2024-11-06 23:30:13,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:30:13,511 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 99 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 906 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:30:13,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 906 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:30:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-06 23:30:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2024-11-06 23:30:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 282 states have (on average 1.524822695035461) internal successors, (430), 285 states have internal predecessors, (430), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-06 23:30:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 551 transitions. [2024-11-06 23:30:13,545 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 551 transitions. Word has length 105 [2024-11-06 23:30:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 551 transitions. [2024-11-06 23:30:13,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 551 transitions. [2024-11-06 23:30:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-06 23:30:13,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:13,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:13,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 23:30:13,748 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:30:13,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:13,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash -949933875, now seen corresponding path program 1 times [2024-11-06 23:30:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851643549] [2024-11-06 23:30:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 23:30:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 23:30:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-06 23:30:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-06 23:30:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-06 23:30:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-06 23:30:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-06 23:30:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 23:30:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 23:30:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:13,993 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:30:13,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851643549] [2024-11-06 23:30:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851643549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672363432] [2024-11-06 23:30:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:13,996 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:30:13,998 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:30:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 23:30:14,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:14,357 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:30:14,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:30:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672363432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:30:14,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-06 23:30:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451470729] [2024-11-06 23:30:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:30:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:30:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:30:14,360 INFO L87 Difference]: Start difference. First operand 366 states and 551 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:14,435 INFO L93 Difference]: Finished difference Result 723 states and 1092 transitions. [2024-11-06 23:30:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:30:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-06 23:30:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:14,439 INFO L225 Difference]: With dead ends: 723 [2024-11-06 23:30:14,439 INFO L226 Difference]: Without dead ends: 368 [2024-11-06 23:30:14,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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:30:14,441 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1849 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:30:14,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1849 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:30:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-06 23:30:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-06 23:30:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 283 states have (on average 1.5229681978798586) internal successors, (431), 287 states have internal predecessors, (431), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-06 23:30:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 554 transitions. [2024-11-06 23:30:14,467 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 554 transitions. Word has length 106 [2024-11-06 23:30:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:14,468 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 554 transitions. [2024-11-06 23:30:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 554 transitions. [2024-11-06 23:30:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 23:30:14,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:14,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:14,493 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:30:14,677 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:30:14,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1105408777, now seen corresponding path program 1 times [2024-11-06 23:30:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675395895] [2024-11-06 23:30:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:30:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:30:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 23:30:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 23:30:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-06 23:30:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-06 23:30:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-06 23:30:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-06 23:30:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:14,918 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:30:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675395895] [2024-11-06 23:30:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675395895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064584878] [2024-11-06 23:30:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:14,921 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:30:14,922 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:30:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 23:30:15,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:15,272 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:30:15,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:30:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064584878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:30:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-06 23:30:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731268624] [2024-11-06 23:30:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:15,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:30:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:30:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:30:15,276 INFO L87 Difference]: Start difference. First operand 368 states and 554 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:15,363 INFO L93 Difference]: Finished difference Result 725 states and 1097 transitions. [2024-11-06 23:30:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:30:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2024-11-06 23:30:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:15,368 INFO L225 Difference]: With dead ends: 725 [2024-11-06 23:30:15,368 INFO L226 Difference]: Without dead ends: 370 [2024-11-06 23:30:15,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 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:30:15,371 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1835 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:30:15,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:30:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-06 23:30:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-06 23:30:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 289 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-06 23:30:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2024-11-06 23:30:15,401 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 107 [2024-11-06 23:30:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2024-11-06 23:30:15,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2024-11-06 23:30:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 23:30:15,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:15,405 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:15,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-06 23:30:15,605 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:30:15,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:15,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1048003723, now seen corresponding path program 1 times [2024-11-06 23:30:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387629934] [2024-11-06 23:30:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:30:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-06 23:30:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:30:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:30:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 23:30:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 23:30:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-06 23:30:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:15,809 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:30:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387629934] [2024-11-06 23:30:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387629934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:30:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192344213] [2024-11-06 23:30:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:15,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:30:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:30:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:30:15,810 INFO L87 Difference]: Start difference. First operand 370 states and 560 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:17,425 INFO L93 Difference]: Finished difference Result 788 states and 1199 transitions. [2024-11-06 23:30:17,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:30:17,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-06 23:30:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:17,428 INFO L225 Difference]: With dead ends: 788 [2024-11-06 23:30:17,428 INFO L226 Difference]: Without dead ends: 441 [2024-11-06 23:30:17,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 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:30:17,430 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 767 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:17,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 926 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:30:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-06 23:30:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 370. [2024-11-06 23:30:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 284 states have (on average 1.5211267605633803) internal successors, (432), 289 states have internal predecessors, (432), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-06 23:30:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2024-11-06 23:30:17,464 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 108 [2024-11-06 23:30:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:17,464 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2024-11-06 23:30:17,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2024-11-06 23:30:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-06 23:30:17,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:17,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:17,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:30:17,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash -887305513, now seen corresponding path program 2 times [2024-11-06 23:30:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020421691] [2024-11-06 23:30:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 23:30:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 23:30:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:30:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:30:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-06 23:30:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-06 23:30:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 23:30:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:17,669 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:30:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020421691] [2024-11-06 23:30:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020421691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:17,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:30:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457032313] [2024-11-06 23:30:17,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:17,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:30:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:30:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:30:17,671 INFO L87 Difference]: Start difference. First operand 370 states and 559 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:19,159 INFO L93 Difference]: Finished difference Result 790 states and 1202 transitions. [2024-11-06 23:30:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:30:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-06 23:30:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:19,163 INFO L225 Difference]: With dead ends: 790 [2024-11-06 23:30:19,163 INFO L226 Difference]: Without dead ends: 443 [2024-11-06 23:30:19,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 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:30:19,165 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 764 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:19,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 926 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 23:30:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-06 23:30:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-06 23:30:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 291 states have internal predecessors, (433), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-06 23:30:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 562 transitions. [2024-11-06 23:30:19,204 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 562 transitions. Word has length 109 [2024-11-06 23:30:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 562 transitions. [2024-11-06 23:30:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 23:30:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 562 transitions. [2024-11-06 23:30:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-06 23:30:19,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:19,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:30:19,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1465707430, now seen corresponding path program 1 times [2024-11-06 23:30:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446669312] [2024-11-06 23:30:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:30:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-06 23:30:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-06 23:30:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:30:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:30:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-06 23:30:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:19,427 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:30:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446669312] [2024-11-06 23:30:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446669312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:30:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743375467] [2024-11-06 23:30:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:19,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:30:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:19,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:30:19,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:30:19,429 INFO L87 Difference]: Start difference. First operand 372 states and 562 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-06 23:30:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:21,457 INFO L93 Difference]: Finished difference Result 788 states and 1197 transitions. [2024-11-06 23:30:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:30:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 110 [2024-11-06 23:30:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:21,466 INFO L225 Difference]: With dead ends: 788 [2024-11-06 23:30:21,466 INFO L226 Difference]: Without dead ends: 443 [2024-11-06 23:30:21,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-06 23:30:21,469 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 767 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:21,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1329 Invalid, 3509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3275 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 23:30:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-06 23:30:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-06 23:30:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 291 states have internal predecessors, (433), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-06 23:30:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 561 transitions. [2024-11-06 23:30:21,509 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 561 transitions. Word has length 110 [2024-11-06 23:30:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:21,509 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 561 transitions. [2024-11-06 23:30:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-06 23:30:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 561 transitions. [2024-11-06 23:30:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:30:21,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:21,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:21,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:30:21,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -499579042, now seen corresponding path program 2 times [2024-11-06 23:30:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:21,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243985897] [2024-11-06 23:30:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-06 23:30:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:30:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:30:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:30:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 23:30:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 23:30:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:21,728 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:30:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243985897] [2024-11-06 23:30:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243985897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 23:30:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559204417] [2024-11-06 23:30:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:30:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:30:21,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:30:21,730 INFO L87 Difference]: Start difference. First operand 372 states and 561 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-06 23:30:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:23,596 INFO L93 Difference]: Finished difference Result 790 states and 1203 transitions. [2024-11-06 23:30:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:30:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2024-11-06 23:30:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:23,600 INFO L225 Difference]: With dead ends: 790 [2024-11-06 23:30:23,600 INFO L226 Difference]: Without dead ends: 445 [2024-11-06 23:30:23,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 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:30:23,603 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 764 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:23,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1330 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 23:30:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-06 23:30:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 374. [2024-11-06 23:30:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 286 states have (on average 1.5174825174825175) internal successors, (434), 293 states have internal predecessors, (434), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-06 23:30:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 567 transitions. [2024-11-06 23:30:23,632 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 567 transitions. Word has length 111 [2024-11-06 23:30:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 567 transitions. [2024-11-06 23:30:23,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-06 23:30:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 567 transitions. [2024-11-06 23:30:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 23:30:23,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:23,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:23,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:30:23,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1056550783, now seen corresponding path program 1 times [2024-11-06 23:30:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:23,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201397988] [2024-11-06 23:30:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 23:30:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:30:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-06 23:30:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:30:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:30:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-06 23:30:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:23,784 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:30:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201397988] [2024-11-06 23:30:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201397988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:30:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41772569] [2024-11-06 23:30:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:30:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:30:23,787 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:30:23,789 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:30:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:24,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:30:24,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:30:24,075 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:30:24,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:30:24,159 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:30:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41772569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:30:24,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:30:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-06 23:30:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305460326] [2024-11-06 23:30:24,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:30:24,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 23:30:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:24,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 23:30:24,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:30:24,161 INFO L87 Difference]: Start difference. First operand 374 states and 567 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-06 23:30:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:25,716 INFO L93 Difference]: Finished difference Result 944 states and 1501 transitions. [2024-11-06 23:30:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:30:25,716 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-11-06 23:30:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:25,722 INFO L225 Difference]: With dead ends: 944 [2024-11-06 23:30:25,722 INFO L226 Difference]: Without dead ends: 772 [2024-11-06 23:30:25,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 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:25,727 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1056 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:25,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1452 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:30:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-06 23:30:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 677. [2024-11-06 23:30:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 525 states have (on average 1.5847619047619048) internal successors, (832), 532 states have internal predecessors, (832), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-11-06 23:30:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1103 transitions. [2024-11-06 23:30:25,766 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1103 transitions. Word has length 112 [2024-11-06 23:30:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1103 transitions. [2024-11-06 23:30:25,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-06 23:30:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1103 transitions. [2024-11-06 23:30:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-06 23:30:25,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:25,770 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, 1] [2024-11-06 23:30:25,788 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:25,974 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:25,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 88149732, now seen corresponding path program 1 times [2024-11-06 23:30:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813849137] [2024-11-06 23:30:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 23:30:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-06 23:30:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:30:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-06 23:30:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 23:30:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-06 23:30:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:26,088 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:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813849137] [2024-11-06 23:30:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813849137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:26,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:26,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621850712] [2024-11-06 23:30:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:26,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:26,090 INFO L87 Difference]: Start difference. First operand 677 states and 1103 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:27,059 INFO L93 Difference]: Finished difference Result 1665 states and 2780 transitions. [2024-11-06 23:30:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:27,059 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-06 23:30:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:27,065 INFO L225 Difference]: With dead ends: 1665 [2024-11-06 23:30:27,065 INFO L226 Difference]: Without dead ends: 1056 [2024-11-06 23:30:27,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:27,068 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 860 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:27,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 665 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 23:30:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-06 23:30:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 977. [2024-11-06 23:30:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 761 states have (on average 1.5992115637319317) internal successors, (1217), 768 states have internal predecessors, (1217), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-11-06 23:30:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1626 transitions. [2024-11-06 23:30:27,116 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1626 transitions. Word has length 118 [2024-11-06 23:30:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:27,117 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1626 transitions. [2024-11-06 23:30:27,117 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1626 transitions. [2024-11-06 23:30:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 23:30:27,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:27,122 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, 1, 1] [2024-11-06 23:30:27,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:30:27,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:27,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 418572611, now seen corresponding path program 1 times [2024-11-06 23:30:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748902246] [2024-11-06 23:30:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:30:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 23:30:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-06 23:30:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 23:30:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-06 23:30:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 23:30:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:27,231 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:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748902246] [2024-11-06 23:30:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748902246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082749283] [2024-11-06 23:30:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:27,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:27,232 INFO L87 Difference]: Start difference. First operand 977 states and 1626 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:28,113 INFO L93 Difference]: Finished difference Result 2380 states and 4025 transitions. [2024-11-06 23:30:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:28,113 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-06 23:30:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:28,121 INFO L225 Difference]: With dead ends: 2380 [2024-11-06 23:30:28,121 INFO L226 Difference]: Without dead ends: 1524 [2024-11-06 23:30:28,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:28,138 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 858 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:28,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 657 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:30:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-06 23:30:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1445. [2024-11-06 23:30:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1134 states have (on average 1.6084656084656084) internal successors, (1824), 1141 states have internal predecessors, (1824), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-11-06 23:30:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2423 transitions. [2024-11-06 23:30:28,208 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2423 transitions. Word has length 119 [2024-11-06 23:30:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:28,208 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2423 transitions. [2024-11-06 23:30:28,208 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, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2423 transitions. [2024-11-06 23:30:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 23:30:28,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:28,215 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, 1, 1, 1] [2024-11-06 23:30:28,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 23:30:28,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2089768670, now seen corresponding path program 1 times [2024-11-06 23:30:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:28,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221288682] [2024-11-06 23:30:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:30:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-06 23:30:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:30:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-06 23:30:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-06 23:30:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-06 23:30:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:28,301 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:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221288682] [2024-11-06 23:30:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221288682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779342757] [2024-11-06 23:30:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:28,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:28,303 INFO L87 Difference]: Start difference. First operand 1445 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:29,141 INFO L93 Difference]: Finished difference Result 3427 states and 5866 transitions. [2024-11-06 23:30:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-06 23:30:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:29,152 INFO L225 Difference]: With dead ends: 3427 [2024-11-06 23:30:29,152 INFO L226 Difference]: Without dead ends: 2228 [2024-11-06 23:30:29,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:29,157 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 856 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:29,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 646 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:30:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-06 23:30:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2149. [2024-11-06 23:30:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1715 states have (on average 1.6157434402332362) internal successors, (2771), 1722 states have internal predecessors, (2771), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-11-06 23:30:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3632 transitions. [2024-11-06 23:30:29,257 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3632 transitions. Word has length 120 [2024-11-06 23:30:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:29,257 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3632 transitions. [2024-11-06 23:30:29,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3632 transitions. [2024-11-06 23:30:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-06 23:30:29,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:29,267 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, 1, 1, 1, 1] [2024-11-06 23:30:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 23:30:29,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1022927198, now seen corresponding path program 1 times [2024-11-06 23:30:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40420803] [2024-11-06 23:30:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-06 23:30:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-06 23:30:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-06 23:30:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:30:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-06 23:30:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-06 23:30:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:29,366 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:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40420803] [2024-11-06 23:30:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40420803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955767132] [2024-11-06 23:30:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:29,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:29,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:29,367 INFO L87 Difference]: Start difference. First operand 2149 states and 3632 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:30,223 INFO L93 Difference]: Finished difference Result 5046 states and 8720 transitions. [2024-11-06 23:30:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-06 23:30:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:30,242 INFO L225 Difference]: With dead ends: 5046 [2024-11-06 23:30:30,243 INFO L226 Difference]: Without dead ends: 3347 [2024-11-06 23:30:30,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:30,249 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 854 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:30,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 646 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:30:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2024-11-06 23:30:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3268. [2024-11-06 23:30:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 2655 states have (on average 1.6203389830508474) internal successors, (4302), 2662 states have internal predecessors, (4302), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-11-06 23:30:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5547 transitions. [2024-11-06 23:30:30,423 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5547 transitions. Word has length 121 [2024-11-06 23:30:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:30,423 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5547 transitions. [2024-11-06 23:30:30,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5547 transitions. [2024-11-06 23:30:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-06 23:30:30,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:30,436 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, 1, 1, 1, 1, 1] [2024-11-06 23:30:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 23:30:30,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:30,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1502297978, now seen corresponding path program 1 times [2024-11-06 23:30:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587860253] [2024-11-06 23:30:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:30:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 23:30:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:30:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 23:30:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-06 23:30:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-06 23:30:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:30,523 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:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587860253] [2024-11-06 23:30:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587860253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916784723] [2024-11-06 23:30:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:30,524 INFO L87 Difference]: Start difference. First operand 3268 states and 5547 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:31,443 INFO L93 Difference]: Finished difference Result 7964 states and 13819 transitions. [2024-11-06 23:30:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-06 23:30:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:31,474 INFO L225 Difference]: With dead ends: 7964 [2024-11-06 23:30:31,474 INFO L226 Difference]: Without dead ends: 5378 [2024-11-06 23:30:31,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:31,484 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 852 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:31,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 698 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:30:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2024-11-06 23:30:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5299. [2024-11-06 23:30:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4310 states have (on average 1.6134570765661254) internal successors, (6954), 4317 states have internal predecessors, (6954), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-11-06 23:30:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 8995 transitions. [2024-11-06 23:30:31,713 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 8995 transitions. Word has length 122 [2024-11-06 23:30:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 8995 transitions. [2024-11-06 23:30:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 8995 transitions. [2024-11-06 23:30:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 23:30:31,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:31,731 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, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 23:30:31,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1397339966, now seen corresponding path program 1 times [2024-11-06 23:30:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035129464] [2024-11-06 23:30:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 23:30:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-06 23:30:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 23:30:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:30:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-06 23:30:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-06 23:30:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:31,830 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:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035129464] [2024-11-06 23:30:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035129464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:31,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919178316] [2024-11-06 23:30:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:31,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:31,834 INFO L87 Difference]: Start difference. First operand 5299 states and 8995 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:32,912 INFO L93 Difference]: Finished difference Result 13106 states and 22728 transitions. [2024-11-06 23:30:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-06 23:30:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:32,955 INFO L225 Difference]: With dead ends: 13106 [2024-11-06 23:30:32,955 INFO L226 Difference]: Without dead ends: 8866 [2024-11-06 23:30:32,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:32,971 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 850 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:32,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 647 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:30:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-11-06 23:30:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8787. [2024-11-06 23:30:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8787 states, 7192 states have (on average 1.6112347052280311) internal successors, (11588), 7199 states have internal predecessors, (11588), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-11-06 23:30:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 14919 transitions. [2024-11-06 23:30:33,377 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 14919 transitions. Word has length 123 [2024-11-06 23:30:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 8787 states and 14919 transitions. [2024-11-06 23:30:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 14919 transitions. [2024-11-06 23:30:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 23:30:33,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:33,395 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 23:30:33,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 213501156, now seen corresponding path program 1 times [2024-11-06 23:30:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722239945] [2024-11-06 23:30:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 23:30:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:30:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-06 23:30:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 23:30:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-06 23:30:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-06 23:30:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:33,486 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:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:33,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722239945] [2024-11-06 23:30:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722239945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479825493] [2024-11-06 23:30:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:33,488 INFO L87 Difference]: Start difference. First operand 8787 states and 14919 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:34,519 INFO L93 Difference]: Finished difference Result 22765 states and 39434 transitions. [2024-11-06 23:30:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-06 23:30:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:34,577 INFO L225 Difference]: With dead ends: 22765 [2024-11-06 23:30:34,577 INFO L226 Difference]: Without dead ends: 15459 [2024-11-06 23:30:34,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:34,599 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 848 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:34,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 682 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:30:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2024-11-06 23:30:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15380. [2024-11-06 23:30:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15380 states, 12582 states have (on average 1.6018121125417262) internal successors, (20154), 12589 states have internal predecessors, (20154), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-11-06 23:30:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15380 states to 15380 states and 26035 transitions. [2024-11-06 23:30:35,259 INFO L78 Accepts]: Start accepts. Automaton has 15380 states and 26035 transitions. Word has length 124 [2024-11-06 23:30:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 15380 states and 26035 transitions. [2024-11-06 23:30:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 15380 states and 26035 transitions. [2024-11-06 23:30:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-06 23:30:35,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:35,286 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:35,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 23:30:35,286 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:35,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1851360003, now seen corresponding path program 1 times [2024-11-06 23:30:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:35,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383522837] [2024-11-06 23:30:35,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:35,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-06 23:30:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:30:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 23:30:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-06 23:30:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-06 23:30:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-06 23:30:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:35,392 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,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383522837] [2024-11-06 23:30:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383522837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:35,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:35,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024930846] [2024-11-06 23:30:35,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:35,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:35,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:35,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:35,393 INFO L87 Difference]: Start difference. First operand 15380 states and 26035 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:36,723 INFO L93 Difference]: Finished difference Result 40721 states and 70417 transitions. [2024-11-06 23:30:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-06 23:30:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:36,840 INFO L225 Difference]: With dead ends: 40721 [2024-11-06 23:30:36,840 INFO L226 Difference]: Without dead ends: 27429 [2024-11-06 23:30:36,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:36,877 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 846 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:36,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 647 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 23:30:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2024-11-06 23:30:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 27350. [2024-11-06 23:30:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27350 states, 22513 states have (on average 1.5973881757206947) internal successors, (35962), 22520 states have internal predecessors, (35962), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-11-06 23:30:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 46195 transitions. [2024-11-06 23:30:37,789 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 46195 transitions. Word has length 125 [2024-11-06 23:30:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 27350 states and 46195 transitions. [2024-11-06 23:30:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 46195 transitions. [2024-11-06 23:30:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-06 23:30:37,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:37,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:37,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 23:30:37,816 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1715555102, now seen corresponding path program 1 times [2024-11-06 23:30:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:37,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602325217] [2024-11-06 23:30:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-06 23:30:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:30:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-06 23:30:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-06 23:30:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 23:30:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-06 23:30:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:38,127 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:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602325217] [2024-11-06 23:30:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602325217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457351746] [2024-11-06 23:30:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:38,129 INFO L87 Difference]: Start difference. First operand 27350 states and 46195 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:39,972 INFO L93 Difference]: Finished difference Result 74508 states and 128016 transitions. [2024-11-06 23:30:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-06 23:30:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:40,215 INFO L225 Difference]: With dead ends: 74508 [2024-11-06 23:30:40,215 INFO L226 Difference]: Without dead ends: 49978 [2024-11-06 23:30:40,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:40,309 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 844 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:40,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 671 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 23:30:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2024-11-06 23:30:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49899. [2024-11-06 23:30:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49899 states, 41347 states have (on average 1.5914818487435607) internal successors, (65803), 41354 states have internal predecessors, (65803), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-11-06 23:30:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49899 states to 49899 states and 83998 transitions. [2024-11-06 23:30:42,078 INFO L78 Accepts]: Start accepts. Automaton has 49899 states and 83998 transitions. Word has length 126 [2024-11-06 23:30:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 49899 states and 83998 transitions. [2024-11-06 23:30:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49899 states and 83998 transitions. [2024-11-06 23:30:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-06 23:30:42,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:42,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:42,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 23:30:42,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:42,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 425305917, now seen corresponding path program 1 times [2024-11-06 23:30:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171026356] [2024-11-06 23:30:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:30:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-06 23:30:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-06 23:30:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 23:30:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-06 23:30:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-06 23:30:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:42,199 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:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171026356] [2024-11-06 23:30:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171026356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:42,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:30:42,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962502839] [2024-11-06 23:30:42,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:30:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:42,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:30:42,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:30:42,201 INFO L87 Difference]: Start difference. First operand 49899 states and 83998 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:45,055 INFO L93 Difference]: Finished difference Result 92994 states and 160147 transitions. [2024-11-06 23:30:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:30:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-06 23:30:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:45,512 INFO L225 Difference]: With dead ends: 92994 [2024-11-06 23:30:45,513 INFO L226 Difference]: Without dead ends: 92822 [2024-11-06 23:30:45,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:45,575 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 839 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:45,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 655 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:30:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92822 states. [2024-11-06 23:30:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92822 to 92743. [2024-11-06 23:30:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92743 states, 77392 states have (on average 1.5840009303287161) internal successors, (122589), 77399 states have internal predecessors, (122589), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-06 23:30:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92743 states to 92743 states and 155428 transitions. [2024-11-06 23:30:48,788 INFO L78 Accepts]: Start accepts. Automaton has 92743 states and 155428 transitions. Word has length 127 [2024-11-06 23:30:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:30:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 92743 states and 155428 transitions. [2024-11-06 23:30:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 23:30:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 92743 states and 155428 transitions. [2024-11-06 23:30:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 23:30:48,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:30:48,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:30:48,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 23:30:48,830 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:30:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:30:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1225218141, now seen corresponding path program 1 times [2024-11-06 23:30:48,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:30:48,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958501331] [2024-11-06 23:30:48,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:30:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:30:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:30:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:30:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:30:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:30:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:30:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:30:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:30:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:30:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 23:30:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-06 23:30:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-06 23:30:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-06 23:30:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:30:49,663 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:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:30:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958501331] [2024-11-06 23:30:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958501331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:30:49,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:30:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-06 23:30:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182565101] [2024-11-06 23:30:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:30:49,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 23:30:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:30:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 23:30:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:30:49,667 INFO L87 Difference]: Start difference. First operand 92743 states and 155428 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 23:30:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:30:57,210 INFO L93 Difference]: Finished difference Result 185256 states and 322377 transitions. [2024-11-06 23:30:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-06 23:30:57,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 128 [2024-11-06 23:30:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:30:57,964 INFO L225 Difference]: With dead ends: 185256 [2024-11-06 23:30:57,964 INFO L226 Difference]: Without dead ends: 185092 [2024-11-06 23:30:58,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-11-06 23:30:58,033 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 3364 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 6500 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 7546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:30:58,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 2507 Invalid, 7546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 6500 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 23:30:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185092 states. [2024-11-06 23:31:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185092 to 184738. [2024-11-06 23:31:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184738 states, 154229 states have (on average 1.5848900012319342) internal successors, (244436), 154133 states have internal predecessors, (244436), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-11-06 23:31:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184738 states to 184738 states and 312973 transitions. [2024-11-06 23:31:05,389 INFO L78 Accepts]: Start accepts. Automaton has 184738 states and 312973 transitions. Word has length 128 [2024-11-06 23:31:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:31:05,389 INFO L471 AbstractCegarLoop]: Abstraction has 184738 states and 312973 transitions. [2024-11-06 23:31:05,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 11 states have internal predecessors, (89), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 23:31:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 184738 states and 312973 transitions. [2024-11-06 23:31:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-06 23:31:05,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:31:05,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:31:05,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 23:31:05,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:31:05,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:31:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash 119811374, now seen corresponding path program 1 times [2024-11-06 23:31:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:31:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643829764] [2024-11-06 23:31:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:31:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:31:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 23:31:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 23:31:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 23:31:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 23:31:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:31:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:31:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:31:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:31:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 23:31:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-06 23:31:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-06 23:31:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-06 23:31:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:31:05,696 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:31:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:31:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643829764] [2024-11-06 23:31:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643829764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:31:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:31:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-06 23:31:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185547414] [2024-11-06 23:31:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:31:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 23:31:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:31:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 23:31:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-06 23:31:05,698 INFO L87 Difference]: Start difference. First operand 184738 states and 312973 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12)