./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:00:05,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:00:05,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:00:05,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:00:05,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:00:05,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:00:05,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:00:05,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:00:05,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:00:05,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:00:05,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:00:05,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:00:05,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:00:05,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:00:05,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:00:05,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:00:05,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:00:05,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:00:05,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:00:05,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:00:05,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:00:05,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:00:05,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:00:05,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:00:05,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:00:05,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:00:05,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:00:05,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:00:05,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:00:05,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:00:05,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:00:05,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:00:05,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:00:05,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:00:05,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:00:05,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:00:05,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:00:05,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 [2024-11-08 15:00:05,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:00:05,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:00:05,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:00:05,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:00:05,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:00:05,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-08 15:00:07,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:00:07,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:00:07,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-08 15:00:07,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637ac1cfa/8b651f7d8671435b89546c2a92ed8805/FLAG580c27ffb [2024-11-08 15:00:07,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637ac1cfa/8b651f7d8671435b89546c2a92ed8805 [2024-11-08 15:00:07,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:00:07,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:00:07,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:00:07,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:00:07,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:00:07,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:07,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e9d3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07, skipping insertion in model container [2024-11-08 15:00:07,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:07,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:00:07,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c[51091,51104] [2024-11-08 15:00:07,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:00:07,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:00:07,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-08 15:00:07,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-08 15:00:07,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1494] [2024-11-08 15:00:07,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1512] [2024-11-08 15:00:07,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1561] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1592] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1739] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2019] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2232] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2241] [2024-11-08 15:00:07,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2643] [2024-11-08 15:00:07,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c[51091,51104] [2024-11-08 15:00:07,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:00:07,984 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:00:07,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07 WrapperNode [2024-11-08 15:00:07,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:00:07,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:00:07,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:00:07,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:00:08,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,117 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-11-08 15:00:08,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:00:08,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:00:08,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:00:08,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:00:08,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,153 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-08 15:00:08,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:00:08,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:00:08,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:00:08,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:00:08,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (1/1) ... [2024-11-08 15:00:08,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:00:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:08,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:00:08,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:00:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-08 15:00:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-08 15:00:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-08 15:00:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-08 15:00:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-08 15:00:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-08 15:00:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-08 15:00:08,272 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-08 15:00:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-08 15:00:08,272 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-08 15:00:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-08 15:00:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-08 15:00:08,273 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-08 15:00:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-08 15:00:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-08 15:00:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-08 15:00:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-08 15:00:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-08 15:00:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-08 15:00:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-08 15:00:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-08 15:00:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-08 15:00:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-08 15:00:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-08 15:00:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-08 15:00:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-08 15:00:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:00:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:00:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:00:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-08 15:00:08,277 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-08 15:00:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:00:08,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:00:08,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:00:08,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:00:09,085 INFO L? ?]: Removed 398 outVars from TransFormulas that were not future-live. [2024-11-08 15:00:09,085 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:00:09,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:00:09,111 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:00:09,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:00:09 BoogieIcfgContainer [2024-11-08 15:00:09,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:00:09,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:00:09,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:00:09,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:00:09,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:00:07" (1/3) ... [2024-11-08 15:00:09,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6746c8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:00:09, skipping insertion in model container [2024-11-08 15:00:09,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:00:07" (2/3) ... [2024-11-08 15:00:09,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6746c8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:00:09, skipping insertion in model container [2024-11-08 15:00:09,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:00:09" (3/3) ... [2024-11-08 15:00:09,121 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2024-11-08 15:00:09,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:00:09,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:00:09,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:00:09,218 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;@75a4be43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:00:09,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:00:09,224 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-08 15:00:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 15:00:09,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:09,240 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-08 15:00:09,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:09,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 610945282, now seen corresponding path program 1 times [2024-11-08 15:00:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884952841] [2024-11-08 15:00:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:00:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:00:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:00:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:00:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:00:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 15:00:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:00:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:00:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:00:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:09,866 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-08 15:00:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:09,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884952841] [2024-11-08 15:00:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884952841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:09,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208794688] [2024-11-08 15:00:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:09,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:09,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:09,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:00:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 15:00:10,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:10,127 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-08 15:00:10,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:00:10,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208794688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:10,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:00:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-08 15:00:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834127680] [2024-11-08 15:00:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:10,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:00:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:00:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:00:10,157 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-08 15:00:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:10,220 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2024-11-08 15:00:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:00:10,222 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-08 15:00:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:10,241 INFO L225 Difference]: With dead ends: 505 [2024-11-08 15:00:10,241 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 15:00:10,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:00:10,250 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-08 15:00:10,251 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-08 15:00:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 15:00:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-08 15:00:10,310 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-08 15:00:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 473 transitions. [2024-11-08 15:00:10,317 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 473 transitions. Word has length 98 [2024-11-08 15:00:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 473 transitions. [2024-11-08 15:00:10,320 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-08 15:00:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 473 transitions. [2024-11-08 15:00:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:00:10,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:10,329 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-08 15:00:10,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:00:10,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 15:00:10,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:10,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2132313920, now seen corresponding path program 1 times [2024-11-08 15:00:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496378700] [2024-11-08 15:00:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:00:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:00:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:00:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:00:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:00:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:00:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:00:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:00:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:00:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:10,826 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-08 15:00:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496378700] [2024-11-08 15:00:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496378700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023710016] [2024-11-08 15:00:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:10,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:10,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:00:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 15:00:11,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:11,105 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-08 15:00:11,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:00:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023710016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:00:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-08 15:00:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950879894] [2024-11-08 15:00:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:11,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:00:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:00:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:00:11,110 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-08 15:00:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:11,147 INFO L93 Difference]: Finished difference Result 495 states and 713 transitions. [2024-11-08 15:00:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:00:11,148 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-08 15:00:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:11,150 INFO L225 Difference]: With dead ends: 495 [2024-11-08 15:00:11,150 INFO L226 Difference]: Without dead ends: 323 [2024-11-08 15:00:11,154 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-08 15:00:11,156 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-08 15:00:11,157 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-08 15:00:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-08 15:00:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-08 15:00:11,182 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-08 15:00:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 475 transitions. [2024-11-08 15:00:11,187 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 475 transitions. Word has length 99 [2024-11-08 15:00:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:11,189 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 475 transitions. [2024-11-08 15:00:11,189 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-08 15:00:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 475 transitions. [2024-11-08 15:00:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 15:00:11,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:11,195 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-08 15:00:11,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:00:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-08 15:00:11,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2004971831, now seen corresponding path program 1 times [2024-11-08 15:00:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566311992] [2024-11-08 15:00:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:00:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:00:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:00:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 15:00:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:00:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:00:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:00:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:00:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:00:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,620 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-08 15:00:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566311992] [2024-11-08 15:00:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566311992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609336727] [2024-11-08 15:00:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:11,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:11,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:00:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:11,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:00:11,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:11,851 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-08 15:00:11,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:00:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609336727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:00:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-08 15:00:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057938672] [2024-11-08 15:00:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:11,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:00:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:11,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:00:11,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:00:11,853 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-08 15:00:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:11,876 INFO L93 Difference]: Finished difference Result 669 states and 1001 transitions. [2024-11-08 15:00:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:00:11,877 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-08 15:00:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:11,880 INFO L225 Difference]: With dead ends: 669 [2024-11-08 15:00:11,880 INFO L226 Difference]: Without dead ends: 374 [2024-11-08 15:00:11,881 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-08 15:00:11,882 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-08 15:00:11,882 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-08 15:00:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-08 15:00:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2024-11-08 15:00:11,901 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-08 15:00:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 551 transitions. [2024-11-08 15:00:11,903 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 551 transitions. Word has length 105 [2024-11-08 15:00:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 551 transitions. [2024-11-08 15:00:11,903 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-08 15:00:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 551 transitions. [2024-11-08 15:00:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 15:00:11,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:11,905 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-08 15:00:11,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:00:12,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:12,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -949933875, now seen corresponding path program 1 times [2024-11-08 15:00:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233203623] [2024-11-08 15:00:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:00:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:00:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:00:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 15:00:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 15:00:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:00:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:00:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:00:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 15:00:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,313 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-08 15:00:12,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233203623] [2024-11-08 15:00:12,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233203623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432512805] [2024-11-08 15:00:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:12,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:12,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:12,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:12,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:00:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:12,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:00:12,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:12,608 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-08 15:00:12,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:00:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432512805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:00:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-08 15:00:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286243254] [2024-11-08 15:00:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:12,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:00:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:00:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:00:12,612 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-08 15:00:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:12,664 INFO L93 Difference]: Finished difference Result 723 states and 1092 transitions. [2024-11-08 15:00:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:00:12,665 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-08 15:00:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:12,667 INFO L225 Difference]: With dead ends: 723 [2024-11-08 15:00:12,667 INFO L226 Difference]: Without dead ends: 368 [2024-11-08 15:00:12,668 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-08 15:00:12,670 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-08 15:00:12,670 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-08 15:00:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-08 15:00:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-08 15:00:12,690 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-08 15:00:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 554 transitions. [2024-11-08 15:00:12,693 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 554 transitions. Word has length 106 [2024-11-08 15:00:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 554 transitions. [2024-11-08 15:00:12,694 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-08 15:00:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 554 transitions. [2024-11-08 15:00:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 15:00:12,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:12,696 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-08 15:00:12,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:00:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:12,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1105408777, now seen corresponding path program 1 times [2024-11-08 15:00:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24443790] [2024-11-08 15:00:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:00:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:00:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 15:00:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:00:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:00:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:00:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:00:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 15:00:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,117 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-08 15:00:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24443790] [2024-11-08 15:00:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24443790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978419768] [2024-11-08 15:00:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:13,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:13,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:13,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:00:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:00:13,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:13,403 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-08 15:00:13,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:00:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978419768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:13,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:00:13,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-08 15:00:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658665007] [2024-11-08 15:00:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:00:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:00:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:00:13,408 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-08 15:00:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:13,465 INFO L93 Difference]: Finished difference Result 725 states and 1097 transitions. [2024-11-08 15:00:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:00:13,466 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-08 15:00:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:13,470 INFO L225 Difference]: With dead ends: 725 [2024-11-08 15:00:13,470 INFO L226 Difference]: Without dead ends: 370 [2024-11-08 15:00:13,471 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-08 15:00:13,472 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-08 15:00:13,472 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-08 15:00:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-08 15:00:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-08 15:00:13,488 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-08 15:00:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2024-11-08 15:00:13,491 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 107 [2024-11-08 15:00:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:13,491 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2024-11-08 15:00:13,491 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-08 15:00:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2024-11-08 15:00:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 15:00:13,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:13,493 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-08 15:00:13,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:00:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:13,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1048003723, now seen corresponding path program 1 times [2024-11-08 15:00:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933600081] [2024-11-08 15:00:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:00:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:00:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:00:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:00:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:00:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:00:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:00:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:13,852 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-08 15:00:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:13,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933600081] [2024-11-08 15:00:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933600081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:00:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271915315] [2024-11-08 15:00:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:13,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:00:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:00:13,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:00:13,859 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-08 15:00:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:15,272 INFO L93 Difference]: Finished difference Result 788 states and 1199 transitions. [2024-11-08 15:00:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:00:15,273 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-08 15:00:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:15,276 INFO L225 Difference]: With dead ends: 788 [2024-11-08 15:00:15,277 INFO L226 Difference]: Without dead ends: 441 [2024-11-08 15:00:15,278 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-08 15:00:15,279 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 767 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:15,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 926 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:00:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-08 15:00:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 370. [2024-11-08 15:00:15,318 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-08 15:00:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2024-11-08 15:00:15,320 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 108 [2024-11-08 15:00:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2024-11-08 15:00:15,321 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-08 15:00:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2024-11-08 15:00:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 15:00:15,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:15,326 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-08 15:00:15,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:00:15,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -887305513, now seen corresponding path program 2 times [2024-11-08 15:00:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:15,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308787065] [2024-11-08 15:00:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:00:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:00:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:00:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:00:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:00:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:00:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:00:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:15,503 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-08 15:00:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308787065] [2024-11-08 15:00:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308787065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:00:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039957344] [2024-11-08 15:00:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:00:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:00:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:00:15,504 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-08 15:00:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:16,723 INFO L93 Difference]: Finished difference Result 790 states and 1202 transitions. [2024-11-08 15:00:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:00:16,723 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-08 15:00:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:16,726 INFO L225 Difference]: With dead ends: 790 [2024-11-08 15:00:16,726 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 15:00:16,727 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-08 15:00:16,728 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 764 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:16,728 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.1s Time] [2024-11-08 15:00:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 15:00:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-08 15:00:16,748 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-08 15:00:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 562 transitions. [2024-11-08 15:00:16,750 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 562 transitions. Word has length 109 [2024-11-08 15:00:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:16,751 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 562 transitions. [2024-11-08 15:00:16,751 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-08 15:00:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 562 transitions. [2024-11-08 15:00:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 15:00:16,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:16,753 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-08 15:00:16,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:00:16,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1465707430, now seen corresponding path program 1 times [2024-11-08 15:00:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992233922] [2024-11-08 15:00:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:00:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:00:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:00:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:00:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:00:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:00:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:16,966 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-08 15:00:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992233922] [2024-11-08 15:00:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992233922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:16,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 15:00:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509798679] [2024-11-08 15:00:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:00:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:00:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:00:16,967 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-08 15:00:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:18,735 INFO L93 Difference]: Finished difference Result 788 states and 1197 transitions. [2024-11-08 15:00:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:00:18,735 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-08 15:00:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:18,738 INFO L225 Difference]: With dead ends: 788 [2024-11-08 15:00:18,738 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 15:00:18,739 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-08 15:00:18,740 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 767 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:18,740 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.6s Time] [2024-11-08 15:00:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 15:00:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-08 15:00:18,764 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-08 15:00:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 561 transitions. [2024-11-08 15:00:18,766 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 561 transitions. Word has length 110 [2024-11-08 15:00:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:18,766 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 561 transitions. [2024-11-08 15:00:18,766 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-08 15:00:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 561 transitions. [2024-11-08 15:00:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 15:00:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:18,768 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-08 15:00:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:00:18,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -499579042, now seen corresponding path program 2 times [2024-11-08 15:00:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854580000] [2024-11-08 15:00:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:00:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 15:00:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:00:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:00:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:00:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:00:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:18,959 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-08 15:00:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854580000] [2024-11-08 15:00:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854580000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:18,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 15:00:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411670825] [2024-11-08 15:00:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:00:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:00:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:00:18,963 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-08 15:00:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:20,689 INFO L93 Difference]: Finished difference Result 790 states and 1203 transitions. [2024-11-08 15:00:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:00:20,689 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-08 15:00:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:20,692 INFO L225 Difference]: With dead ends: 790 [2024-11-08 15:00:20,692 INFO L226 Difference]: Without dead ends: 445 [2024-11-08 15:00:20,693 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-08 15:00:20,695 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 764 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:20,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1330 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 15:00:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-08 15:00:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 374. [2024-11-08 15:00:20,734 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-08 15:00:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 567 transitions. [2024-11-08 15:00:20,735 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 567 transitions. Word has length 111 [2024-11-08 15:00:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 567 transitions. [2024-11-08 15:00:20,737 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-08 15:00:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 567 transitions. [2024-11-08 15:00:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 15:00:20,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:20,739 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-08 15:00:20,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:00:20,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1056550783, now seen corresponding path program 1 times [2024-11-08 15:00:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:20,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98574080] [2024-11-08 15:00:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:00:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:00:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:00:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:00:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:00:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:00:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:20,870 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-08 15:00:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98574080] [2024-11-08 15:00:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98574080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:00:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132672253] [2024-11-08 15:00:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:00:20,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:00:20,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:00:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:21,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:00:21,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:00:21,124 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-08 15:00:21,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:00:21,213 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-08 15:00:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132672253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:00:21,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:00:21,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-08 15:00:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890229650] [2024-11-08 15:00:21,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:00:21,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:00:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:00:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:00:21,215 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-08 15:00:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:22,605 INFO L93 Difference]: Finished difference Result 944 states and 1501 transitions. [2024-11-08 15:00:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:00:22,606 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-08 15:00:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:22,611 INFO L225 Difference]: With dead ends: 944 [2024-11-08 15:00:22,611 INFO L226 Difference]: Without dead ends: 772 [2024-11-08 15:00:22,612 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-08 15:00:22,613 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1056 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:22,614 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.2s Time] [2024-11-08 15:00:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-08 15:00:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 677. [2024-11-08 15:00:22,642 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-08 15:00:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1103 transitions. [2024-11-08 15:00:22,644 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1103 transitions. Word has length 112 [2024-11-08 15:00:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1103 transitions. [2024-11-08 15:00:22,645 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-08 15:00:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1103 transitions. [2024-11-08 15:00:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 15:00:22,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:22,647 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-08 15:00:22,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:00:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:00:22,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash 88149732, now seen corresponding path program 1 times [2024-11-08 15:00:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353633076] [2024-11-08 15:00:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:00:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:00:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:00:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:00:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:00:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:00:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:22,926 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-08 15:00:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353633076] [2024-11-08 15:00:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353633076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295711997] [2024-11-08 15:00:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:22,927 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-08 15:00:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:23,752 INFO L93 Difference]: Finished difference Result 1665 states and 2780 transitions. [2024-11-08 15:00:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:23,752 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-08 15:00:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:23,757 INFO L225 Difference]: With dead ends: 1665 [2024-11-08 15:00:23,757 INFO L226 Difference]: Without dead ends: 1056 [2024-11-08 15:00:23,759 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-08 15:00:23,760 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 860 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:23,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 666 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:00:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-08 15:00:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 977. [2024-11-08 15:00:23,788 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-08 15:00:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1626 transitions. [2024-11-08 15:00:23,791 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1626 transitions. Word has length 118 [2024-11-08 15:00:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:23,791 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1626 transitions. [2024-11-08 15:00:23,791 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-08 15:00:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1626 transitions. [2024-11-08 15:00:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 15:00:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:23,795 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-08 15:00:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:00:23,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash 418572611, now seen corresponding path program 1 times [2024-11-08 15:00:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806951512] [2024-11-08 15:00:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:00:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:00:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:00:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:00:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:00:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:00:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:23,902 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-08 15:00:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806951512] [2024-11-08 15:00:23,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806951512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:23,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:23,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154478297] [2024-11-08 15:00:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:23,904 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-08 15:00:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:24,658 INFO L93 Difference]: Finished difference Result 2380 states and 4025 transitions. [2024-11-08 15:00:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:24,659 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-08 15:00:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:24,668 INFO L225 Difference]: With dead ends: 2380 [2024-11-08 15:00:24,669 INFO L226 Difference]: Without dead ends: 1524 [2024-11-08 15:00:24,680 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-08 15:00:24,681 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 858 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:24,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 657 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:00:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-08 15:00:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1445. [2024-11-08 15:00:24,736 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-08 15:00:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2423 transitions. [2024-11-08 15:00:24,742 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2423 transitions. Word has length 119 [2024-11-08 15:00:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2423 transitions. [2024-11-08 15:00:24,743 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-08 15:00:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2423 transitions. [2024-11-08 15:00:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 15:00:24,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:24,748 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-08 15:00:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:00:24,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:24,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2089768670, now seen corresponding path program 1 times [2024-11-08 15:00:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749863226] [2024-11-08 15:00:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:00:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:00:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:00:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:00:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:00:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:00:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:24,847 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-08 15:00:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749863226] [2024-11-08 15:00:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749863226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597190262] [2024-11-08 15:00:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:24,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:24,848 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-08 15:00:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:25,656 INFO L93 Difference]: Finished difference Result 3427 states and 5866 transitions. [2024-11-08 15:00:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:25,657 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-08 15:00:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:25,667 INFO L225 Difference]: With dead ends: 3427 [2024-11-08 15:00:25,667 INFO L226 Difference]: Without dead ends: 2228 [2024-11-08 15:00:25,671 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-08 15:00:25,672 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 856 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:25,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 646 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:00:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-08 15:00:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2149. [2024-11-08 15:00:25,777 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-08 15:00:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3632 transitions. [2024-11-08 15:00:25,787 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3632 transitions. Word has length 120 [2024-11-08 15:00:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:25,787 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3632 transitions. [2024-11-08 15:00:25,788 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-08 15:00:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3632 transitions. [2024-11-08 15:00:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 15:00:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:25,799 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-08 15:00:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:00:25,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1022927198, now seen corresponding path program 1 times [2024-11-08 15:00:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100609415] [2024-11-08 15:00:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:00:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:00:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:00:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:00:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 15:00:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:00:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:25,888 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-08 15:00:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100609415] [2024-11-08 15:00:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100609415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:25,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209352327] [2024-11-08 15:00:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:25,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:25,890 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-08 15:00:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:26,719 INFO L93 Difference]: Finished difference Result 5046 states and 8720 transitions. [2024-11-08 15:00:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:26,720 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-08 15:00:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:26,734 INFO L225 Difference]: With dead ends: 5046 [2024-11-08 15:00:26,734 INFO L226 Difference]: Without dead ends: 3347 [2024-11-08 15:00:26,740 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-08 15:00:26,741 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 854 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 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-08 15:00:26,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 646 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:00:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2024-11-08 15:00:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3268. [2024-11-08 15:00:26,841 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-08 15:00:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5547 transitions. [2024-11-08 15:00:26,852 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5547 transitions. Word has length 121 [2024-11-08 15:00:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5547 transitions. [2024-11-08 15:00:26,853 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-08 15:00:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5547 transitions. [2024-11-08 15:00:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 15:00:26,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:26,863 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-08 15:00:26,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:00:26,863 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:26,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1502297978, now seen corresponding path program 1 times [2024-11-08 15:00:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335422010] [2024-11-08 15:00:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 15:00:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:00:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:00:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:00:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 15:00:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 15:00:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:26,954 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-08 15:00:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335422010] [2024-11-08 15:00:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335422010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644793126] [2024-11-08 15:00:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:26,955 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-08 15:00:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:27,904 INFO L93 Difference]: Finished difference Result 7964 states and 13819 transitions. [2024-11-08 15:00:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:27,904 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-08 15:00:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:27,932 INFO L225 Difference]: With dead ends: 7964 [2024-11-08 15:00:27,932 INFO L226 Difference]: Without dead ends: 5378 [2024-11-08 15:00:27,943 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-08 15:00:27,944 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 852 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:27,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 698 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:00:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2024-11-08 15:00:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5299. [2024-11-08 15:00:28,147 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-08 15:00:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 8995 transitions. [2024-11-08 15:00:28,171 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 8995 transitions. Word has length 122 [2024-11-08 15:00:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 8995 transitions. [2024-11-08 15:00:28,171 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-08 15:00:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 8995 transitions. [2024-11-08 15:00:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:00:28,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:28,186 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-08 15:00:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:00:28,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1397339966, now seen corresponding path program 1 times [2024-11-08 15:00:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:28,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978483288] [2024-11-08 15:00:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:00:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:00:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:00:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:00:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 15:00:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:00:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:28,278 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-08 15:00:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978483288] [2024-11-08 15:00:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978483288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885116435] [2024-11-08 15:00:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:28,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:28,279 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-08 15:00:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:29,279 INFO L93 Difference]: Finished difference Result 13106 states and 22728 transitions. [2024-11-08 15:00:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:29,280 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-08 15:00:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:29,328 INFO L225 Difference]: With dead ends: 13106 [2024-11-08 15:00:29,328 INFO L226 Difference]: Without dead ends: 8866 [2024-11-08 15:00:29,343 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-08 15:00:29,344 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-08 15:00:29,344 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-08 15:00:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-11-08 15:00:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8787. [2024-11-08 15:00:29,630 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-08 15:00:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 14919 transitions. [2024-11-08 15:00:29,657 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 14919 transitions. Word has length 123 [2024-11-08 15:00:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:29,658 INFO L471 AbstractCegarLoop]: Abstraction has 8787 states and 14919 transitions. [2024-11-08 15:00:29,658 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-08 15:00:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 14919 transitions. [2024-11-08 15:00:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:00:29,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:29,676 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-08 15:00:29,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:00:29,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:29,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash 213501156, now seen corresponding path program 1 times [2024-11-08 15:00:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:29,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778728268] [2024-11-08 15:00:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:00:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:00:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:00:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 15:00:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 15:00:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 15:00:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:29,797 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-08 15:00:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:29,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778728268] [2024-11-08 15:00:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778728268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643498465] [2024-11-08 15:00:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:29,799 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-08 15:00:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:30,818 INFO L93 Difference]: Finished difference Result 22765 states and 39434 transitions. [2024-11-08 15:00:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:30,822 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-08 15:00:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:30,879 INFO L225 Difference]: With dead ends: 22765 [2024-11-08 15:00:30,880 INFO L226 Difference]: Without dead ends: 15459 [2024-11-08 15:00:30,905 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-08 15:00:30,906 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-08 15:00:30,906 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-08 15:00:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2024-11-08 15:00:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15380. [2024-11-08 15:00:31,457 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-08 15:00:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15380 states to 15380 states and 26035 transitions. [2024-11-08 15:00:31,607 INFO L78 Accepts]: Start accepts. Automaton has 15380 states and 26035 transitions. Word has length 124 [2024-11-08 15:00:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:31,610 INFO L471 AbstractCegarLoop]: Abstraction has 15380 states and 26035 transitions. [2024-11-08 15:00:31,610 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-08 15:00:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15380 states and 26035 transitions. [2024-11-08 15:00:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:00:31,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:31,642 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-08 15:00:31,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:00:31,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1851360003, now seen corresponding path program 1 times [2024-11-08 15:00:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147281951] [2024-11-08 15:00:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:00:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:00:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:00:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 15:00:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:00:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 15:00:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:31,823 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-08 15:00:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147281951] [2024-11-08 15:00:31,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147281951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:31,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639725428] [2024-11-08 15:00:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:31,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:31,827 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-08 15:00:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:33,162 INFO L93 Difference]: Finished difference Result 40721 states and 70417 transitions. [2024-11-08 15:00:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:33,162 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-08 15:00:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:33,273 INFO L225 Difference]: With dead ends: 40721 [2024-11-08 15:00:33,273 INFO L226 Difference]: Without dead ends: 27429 [2024-11-08 15:00:33,334 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-08 15:00:33,335 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 846 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:33,335 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.7s Time] [2024-11-08 15:00:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2024-11-08 15:00:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 27350. [2024-11-08 15:00:34,341 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-08 15:00:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 46195 transitions. [2024-11-08 15:00:34,434 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 46195 transitions. Word has length 125 [2024-11-08 15:00:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 27350 states and 46195 transitions. [2024-11-08 15:00:34,435 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-08 15:00:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 46195 transitions. [2024-11-08 15:00:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 15:00:34,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:34,460 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-08 15:00:34,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:00:34,460 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:34,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1715555102, now seen corresponding path program 1 times [2024-11-08 15:00:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:34,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486176550] [2024-11-08 15:00:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:00:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:00:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:00:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:00:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:00:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 15:00:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:34,550 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-08 15:00:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486176550] [2024-11-08 15:00:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486176550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:34,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314430690] [2024-11-08 15:00:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:34,553 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-08 15:00:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:36,283 INFO L93 Difference]: Finished difference Result 74508 states and 128016 transitions. [2024-11-08 15:00:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:36,284 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-08 15:00:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:36,477 INFO L225 Difference]: With dead ends: 74508 [2024-11-08 15:00:36,478 INFO L226 Difference]: Without dead ends: 49978 [2024-11-08 15:00:36,563 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-08 15:00:36,564 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:36,564 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.7s Time] [2024-11-08 15:00:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2024-11-08 15:00:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49899. [2024-11-08 15:00:38,486 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-08 15:00:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49899 states to 49899 states and 83998 transitions. [2024-11-08 15:00:38,656 INFO L78 Accepts]: Start accepts. Automaton has 49899 states and 83998 transitions. Word has length 126 [2024-11-08 15:00:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:38,656 INFO L471 AbstractCegarLoop]: Abstraction has 49899 states and 83998 transitions. [2024-11-08 15:00:38,656 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-08 15:00:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 49899 states and 83998 transitions. [2024-11-08 15:00:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 15:00:38,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:38,683 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-08 15:00:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:00:38,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:38,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash 425305917, now seen corresponding path program 1 times [2024-11-08 15:00:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709877912] [2024-11-08 15:00:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:00:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:00:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:00:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:00:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:00:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 15:00:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:38,769 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-08 15:00:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709877912] [2024-11-08 15:00:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709877912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:00:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017310342] [2024-11-08 15:00:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:00:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:00:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:00:38,771 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-08 15:00:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:41,356 INFO L93 Difference]: Finished difference Result 92994 states and 160147 transitions. [2024-11-08 15:00:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:00:41,357 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-08 15:00:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:41,702 INFO L225 Difference]: With dead ends: 92994 [2024-11-08 15:00:41,702 INFO L226 Difference]: Without dead ends: 92822 [2024-11-08 15:00:41,748 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-08 15:00:41,750 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 839 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:41,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 655 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:00:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92822 states. [2024-11-08 15:00:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92822 to 92743. [2024-11-08 15:00:44,562 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-08 15:00:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92743 states to 92743 states and 155428 transitions. [2024-11-08 15:00:45,136 INFO L78 Accepts]: Start accepts. Automaton has 92743 states and 155428 transitions. Word has length 127 [2024-11-08 15:00:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:00:45,136 INFO L471 AbstractCegarLoop]: Abstraction has 92743 states and 155428 transitions. [2024-11-08 15:00:45,137 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-08 15:00:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 92743 states and 155428 transitions. [2024-11-08 15:00:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 15:00:45,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:00:45,172 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-08 15:00:45,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:00:45,172 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:00:45,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:00:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1225218141, now seen corresponding path program 1 times [2024-11-08 15:00:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:00:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419501882] [2024-11-08 15:00:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:00:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:00:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:00:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:00:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:00:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:00:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:00:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:00:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:00:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:00:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:00:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:00:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:00:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 15:00:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:00:45,780 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-08 15:00:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:00:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419501882] [2024-11-08 15:00:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419501882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:00:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:00:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 15:00:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198492596] [2024-11-08 15:00:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:00:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:00:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:00:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:00:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:00:45,782 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-08 15:00:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:00:52,971 INFO L93 Difference]: Finished difference Result 185256 states and 322377 transitions. [2024-11-08 15:00:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 15:00:52,971 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-08 15:00:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:00:53,822 INFO L225 Difference]: With dead ends: 185256 [2024-11-08 15:00:53,823 INFO L226 Difference]: Without dead ends: 185092 [2024-11-08 15:00:53,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 15:00:53,902 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 3364 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 6501 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 7547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:00:53,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 2507 Invalid, 7547 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1046 Valid, 6501 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 15:00:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185092 states. [2024-11-08 15:01:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185092 to 184738. [2024-11-08 15:01:00,481 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-08 15:01:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184738 states to 184738 states and 312973 transitions. [2024-11-08 15:01:01,503 INFO L78 Accepts]: Start accepts. Automaton has 184738 states and 312973 transitions. Word has length 128 [2024-11-08 15:01:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:01:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 184738 states and 312973 transitions. [2024-11-08 15:01:01,504 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-08 15:01:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 184738 states and 312973 transitions. [2024-11-08 15:01:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 15:01:01,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:01:01,582 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-08 15:01:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:01:01,582 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:01:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:01:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 119811374, now seen corresponding path program 1 times [2024-11-08 15:01:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:01:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554606896] [2024-11-08 15:01:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:01:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:01:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:01:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:01:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:01:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:01:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:01:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:01:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:01:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:01:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:01:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:01:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 15:01:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 15:01:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:01,781 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-08 15:01:01,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:01:01,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554606896] [2024-11-08 15:01:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554606896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:01:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:01:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 15:01:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745489564] [2024-11-08 15:01:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:01:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:01:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:01:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:01:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:01:01,784 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) [2024-11-08 15:01:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:01:07,870 INFO L93 Difference]: Finished difference Result 185830 states and 321072 transitions. [2024-11-08 15:01:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:01:07,870 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 129 [2024-11-08 15:01:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:01:08,631 INFO L225 Difference]: With dead ends: 185830 [2024-11-08 15:01:08,631 INFO L226 Difference]: Without dead ends: 185054 [2024-11-08 15:01:08,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-11-08 15:01:08,705 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1539 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 4204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:01:08,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1430 Invalid, 4204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 15:01:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185054 states. [2024-11-08 15:01:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185054 to 184829. [2024-11-08 15:01:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184829 states, 154295 states have (on average 1.5848148028127937) internal successors, (244529), 154204 states have internal predecessors, (244529), 30465 states have call successors, (30465), 62 states have call predecessors, (30465), 68 states have return successors, (38125), 30571 states have call predecessors, (38125), 30462 states have call successors, (38125) [2024-11-08 15:01:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184829 states to 184829 states and 313119 transitions. [2024-11-08 15:01:16,003 INFO L78 Accepts]: Start accepts. Automaton has 184829 states and 313119 transitions. Word has length 129 [2024-11-08 15:01:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:01:16,003 INFO L471 AbstractCegarLoop]: Abstraction has 184829 states and 313119 transitions. [2024-11-08 15:01:16,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-08 15:01:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 184829 states and 313119 transitions. [2024-11-08 15:01:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 15:01:16,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:01:16,064 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-08 15:01:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:01:16,064 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:01:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:01:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 474835644, now seen corresponding path program 1 times [2024-11-08 15:01:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:01:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568364769] [2024-11-08 15:01:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:01:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:01:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:01:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:01:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:01:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:01:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:01:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:01:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:01:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:01:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:01:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:01:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 15:01:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 15:01:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:01:16,186 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-08 15:01:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:01:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568364769] [2024-11-08 15:01:16,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568364769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:01:16,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:01:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:01:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578991421] [2024-11-08 15:01:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:01:16,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:01:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:01:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:01:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:01:16,188 INFO L87 Difference]: Start difference. First operand 184829 states and 313119 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)