./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-19 21:51:51,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:51:51,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:51:51,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:51:51,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:51:51,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:51:51,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:51:51,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:51:51,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:51:51,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:51:51,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:51:51,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:51:51,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:51:51,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:51:51,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:51:51,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:51:51,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:51:51,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:51:51,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:51:51,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:51:51,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:51:51,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:51:51,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:51:51,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:51:51,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:51:51,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:51:51,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:51:51,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:51:51,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:51:51,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:51:51,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:51:51,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:51:51,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:51:51,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:51:51,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:51:51,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:51:51,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:51:51,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:51:51,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:51:51,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:51:51,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:51:51,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:51:51,541 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-19 21:51:51,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:51:51,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:51:51,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:51:51,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:51:51,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:51:51,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-19 21:51:53,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:51:53,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:51:53,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2024-11-19 21:51:53,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a595a7af/d3f253a3efc04e37913713ed49433057/FLAGbba389167 [2024-11-19 21:51:53,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a595a7af/d3f253a3efc04e37913713ed49433057 [2024-11-19 21:51:53,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:51:53,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:51:53,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:51:53,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:51:53,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:51:53,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:51:53" (1/1) ... [2024-11-19 21:51:53,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6fbd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:53, skipping insertion in model container [2024-11-19 21:51:53,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:51:53" (1/1) ... [2024-11-19 21:51:53,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:51:54,093 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-19 21:51:54,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:51:54,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:51:54,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-19 21:51:54,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-19 21:51:54,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1494] [2024-11-19 21:51:54,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1512] [2024-11-19 21:51:54,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1561] [2024-11-19 21:51:54,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1592] [2024-11-19 21:51:54,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1739] [2024-11-19 21:51:54,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2019] [2024-11-19 21:51:54,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2232] [2024-11-19 21:51:54,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2241] [2024-11-19 21:51:54,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2643] [2024-11-19 21:51:54,209 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-19 21:51:54,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:51:54,272 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:51:54,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54 WrapperNode [2024-11-19 21:51:54,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:51:54,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:51:54,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:51:54,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:51:54,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,362 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-11-19 21:51:54,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:51:54,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:51:54,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:51:54,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:51:54,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,410 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-19 21:51:54,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:51:54,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:51:54,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:51:54,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:51:54,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (1/1) ... [2024-11-19 21:51:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:51:54,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:54,494 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-19 21:51:54,501 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-19 21:51:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-19 21:51:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-19 21:51:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-19 21:51:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-19 21:51:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-19 21:51:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-19 21:51:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:51:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:51:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:51:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:51:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:51:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:51:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:51:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:51:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-19 21:51:54,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-19 21:51:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:51:54,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:51:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:51:54,539 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:51:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:51:54,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:51:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:51:54,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:51:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:51:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:51:54,540 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:51:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-19 21:51:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-19 21:51:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:51:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:51:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:51:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:51:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:51:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:51:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-19 21:51:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-19 21:51:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:51:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:51:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-19 21:51:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:51:54,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:51:54,543 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:51:54,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:51:54,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:51:54,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:51:54,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:51:55,214 INFO L? ?]: Removed 398 outVars from TransFormulas that were not future-live. [2024-11-19 21:51:55,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:51:55,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:51:55,239 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:51:55,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:51:55 BoogieIcfgContainer [2024-11-19 21:51:55,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:51:55,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:51:55,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:51:55,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:51:55,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:51:53" (1/3) ... [2024-11-19 21:51:55,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fba0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:51:55, skipping insertion in model container [2024-11-19 21:51:55,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:54" (2/3) ... [2024-11-19 21:51:55,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fba0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:51:55, skipping insertion in model container [2024-11-19 21:51:55,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:51:55" (3/3) ... [2024-11-19 21:51:55,247 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2024-11-19 21:51:55,263 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:51:55,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:51:55,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:51:55,335 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;@f0d3792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:51:55,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:51:55,342 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-19 21:51:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 21:51:55,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:55,359 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-19 21:51:55,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 610945282, now seen corresponding path program 1 times [2024-11-19 21:51:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63367627] [2024-11-19 21:51:55,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:51:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:51:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:51:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:51:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:51:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:51:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:51:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:51:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:51:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,113 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-19 21:51:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63367627] [2024-11-19 21:51:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63367627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073418379] [2024-11-19 21:51:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:56,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:56,119 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-19 21:51:56,120 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-19 21:51:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:56,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:51:56,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:56,425 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-19 21:51:56,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073418379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:56,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:56,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-19 21:51:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614495905] [2024-11-19 21:51:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:51:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:51:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:51:56,466 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-19 21:51:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:56,503 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2024-11-19 21:51:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:51:56,505 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-19 21:51:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:56,551 INFO L225 Difference]: With dead ends: 505 [2024-11-19 21:51:56,551 INFO L226 Difference]: Without dead ends: 320 [2024-11-19 21:51:56,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:51:56,559 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-19 21:51:56,560 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-19 21:51:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-19 21:51:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-19 21:51:56,601 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-19 21:51:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 473 transitions. [2024-11-19 21:51:56,605 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 473 transitions. Word has length 98 [2024-11-19 21:51:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:56,606 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 473 transitions. [2024-11-19 21:51:56,606 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-19 21:51:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 473 transitions. [2024-11-19 21:51:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:51:56,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:56,610 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-19 21:51:56,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:51:56,810 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-19 21:51:56,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2132313920, now seen corresponding path program 1 times [2024-11-19 21:51:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:56,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098707946] [2024-11-19 21:51:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:51:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:51:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:51:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:51:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:51:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:51:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:51:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:51:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:51:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,085 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-19 21:51:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098707946] [2024-11-19 21:51:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098707946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946103603] [2024-11-19 21:51:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:57,088 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-19 21:51:57,089 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-19 21:51:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:51:57,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:57,318 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-19 21:51:57,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946103603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:51:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34976297] [2024-11-19 21:51:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:51:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:51:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:51:57,324 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-19 21:51:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:57,357 INFO L93 Difference]: Finished difference Result 495 states and 713 transitions. [2024-11-19 21:51:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:51:57,358 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-19 21:51:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:57,363 INFO L225 Difference]: With dead ends: 495 [2024-11-19 21:51:57,363 INFO L226 Difference]: Without dead ends: 323 [2024-11-19 21:51:57,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:51:57,369 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-19 21:51:57,369 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-19 21:51:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-19 21:51:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-19 21:51:57,396 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-19 21:51:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 475 transitions. [2024-11-19 21:51:57,399 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 475 transitions. Word has length 99 [2024-11-19 21:51:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:57,399 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 475 transitions. [2024-11-19 21:51:57,401 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-19 21:51:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 475 transitions. [2024-11-19 21:51:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 21:51:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:57,404 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-19 21:51:57,416 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-19 21:51:57,608 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-19 21:51:57,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2004971831, now seen corresponding path program 1 times [2024-11-19 21:51:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948472777] [2024-11-19 21:51:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:51:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:51:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:51:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:51:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:51:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:51:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:51:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:51:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:51:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:57,871 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-19 21:51:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948472777] [2024-11-19 21:51:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948472777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945860196] [2024-11-19 21:51:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:57,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:57,875 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-19 21:51:57,877 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-19 21:51:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:51:58,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:58,096 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-19 21:51:58,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945860196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:51:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896058134] [2024-11-19 21:51:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:51:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:51:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:51:58,101 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-19 21:51:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:58,145 INFO L93 Difference]: Finished difference Result 669 states and 1001 transitions. [2024-11-19 21:51:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:51:58,146 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-19 21:51:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:58,148 INFO L225 Difference]: With dead ends: 669 [2024-11-19 21:51:58,148 INFO L226 Difference]: Without dead ends: 374 [2024-11-19 21:51:58,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:51:58,153 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-19 21:51:58,153 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-19 21:51:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-19 21:51:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2024-11-19 21:51:58,176 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-19 21:51:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 551 transitions. [2024-11-19 21:51:58,182 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 551 transitions. Word has length 105 [2024-11-19 21:51:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 551 transitions. [2024-11-19 21:51:58,183 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-19 21:51:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 551 transitions. [2024-11-19 21:51:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 21:51:58,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:58,188 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-19 21:51:58,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:51:58,389 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-19 21:51:58,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:58,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash -949933875, now seen corresponding path program 1 times [2024-11-19 21:51:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986322349] [2024-11-19 21:51:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:51:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:51:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:51:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:51:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:51:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:51:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:51:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:51:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:51:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,707 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-19 21:51:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986322349] [2024-11-19 21:51:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986322349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260017753] [2024-11-19 21:51:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:58,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:58,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:58,714 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-19 21:51:58,715 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-19 21:51:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:58,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:51:58,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:58,989 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-19 21:51:58,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260017753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-19 21:51:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132610825] [2024-11-19 21:51:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:58,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:51:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:51:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:51:58,991 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-19 21:51:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:59,035 INFO L93 Difference]: Finished difference Result 723 states and 1092 transitions. [2024-11-19 21:51:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:51:59,036 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-19 21:51:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:59,038 INFO L225 Difference]: With dead ends: 723 [2024-11-19 21:51:59,038 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 21:51:59,039 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-19 21:51:59,040 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-19 21:51:59,040 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-19 21:51:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 21:51:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-19 21:51:59,048 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-19 21:51:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 554 transitions. [2024-11-19 21:51:59,050 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 554 transitions. Word has length 106 [2024-11-19 21:51:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:59,050 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 554 transitions. [2024-11-19 21:51:59,051 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-19 21:51:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 554 transitions. [2024-11-19 21:51:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:51:59,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:59,052 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-19 21:51:59,065 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-19 21:51:59,252 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-19 21:51:59,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:59,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1105408777, now seen corresponding path program 1 times [2024-11-19 21:51:59,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:59,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747585058] [2024-11-19 21:51:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:51:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:51:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:51:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:51:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:51:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:51:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:51:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:51:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,566 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-19 21:51:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747585058] [2024-11-19 21:51:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747585058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884457211] [2024-11-19 21:51:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:59,570 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-19 21:51:59,575 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-19 21:51:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:59,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:51:59,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:59,842 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-19 21:51:59,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884457211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:59,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-19 21:51:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177624457] [2024-11-19 21:51:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:51:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:51:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:51:59,844 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-19 21:51:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:59,922 INFO L93 Difference]: Finished difference Result 725 states and 1097 transitions. [2024-11-19 21:51:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:51:59,923 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-19 21:51:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:59,925 INFO L225 Difference]: With dead ends: 725 [2024-11-19 21:51:59,925 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 21:51:59,926 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-19 21:51:59,926 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:59,927 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.1s Time] [2024-11-19 21:51:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 21:51:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-19 21:51:59,936 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-19 21:51:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2024-11-19 21:51:59,938 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 107 [2024-11-19 21:51:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:59,938 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2024-11-19 21:51:59,939 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-19 21:51:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2024-11-19 21:51:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:51:59,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:59,944 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-19 21:51:59,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 21:52:00,144 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-19 21:52:00,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1048003723, now seen corresponding path program 1 times [2024-11-19 21:52:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842957939] [2024-11-19 21:52:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:52:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:52:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:52:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:52:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:52:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:52:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:52:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:00,298 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-19 21:52:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842957939] [2024-11-19 21:52:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842957939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:00,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:52:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481733231] [2024-11-19 21:52:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:52:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:00,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:52:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:52:00,300 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-19 21:52:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:01,546 INFO L93 Difference]: Finished difference Result 788 states and 1199 transitions. [2024-11-19 21:52:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:52:01,547 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-19 21:52:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:01,549 INFO L225 Difference]: With dead ends: 788 [2024-11-19 21:52:01,550 INFO L226 Difference]: Without dead ends: 441 [2024-11-19 21:52:01,551 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-19 21:52:01,551 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 767 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:01,551 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.1s Time] [2024-11-19 21:52:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-19 21:52:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 370. [2024-11-19 21:52:01,573 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-19 21:52:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 559 transitions. [2024-11-19 21:52:01,575 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 559 transitions. Word has length 108 [2024-11-19 21:52:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:01,576 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 559 transitions. [2024-11-19 21:52:01,576 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-19 21:52:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 559 transitions. [2024-11-19 21:52:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:52:01,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:01,577 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-19 21:52:01,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:52:01,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash -887305513, now seen corresponding path program 2 times [2024-11-19 21:52:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:01,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186455378] [2024-11-19 21:52:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:52:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:52:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:52:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:52:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:52:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:52:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:52:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:01,715 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-19 21:52:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186455378] [2024-11-19 21:52:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186455378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:52:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292876088] [2024-11-19 21:52:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:01,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:52:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:52:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:52:01,716 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-19 21:52:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:02,923 INFO L93 Difference]: Finished difference Result 790 states and 1202 transitions. [2024-11-19 21:52:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:52:02,923 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-19 21:52:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:02,926 INFO L225 Difference]: With dead ends: 790 [2024-11-19 21:52:02,926 INFO L226 Difference]: Without dead ends: 443 [2024-11-19 21:52:02,927 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-19 21:52:02,928 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-19 21:52:02,928 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-19 21:52:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-19 21:52:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-19 21:52:02,956 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-19 21:52:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 562 transitions. [2024-11-19 21:52:02,961 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 562 transitions. Word has length 109 [2024-11-19 21:52:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 562 transitions. [2024-11-19 21:52:02,961 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-19 21:52:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 562 transitions. [2024-11-19 21:52:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:52:02,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:02,963 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-19 21:52:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:52:02,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1465707430, now seen corresponding path program 1 times [2024-11-19 21:52:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572206628] [2024-11-19 21:52:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:52:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:52:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:52:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:52:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:52:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:52:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:03,172 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-19 21:52:03,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572206628] [2024-11-19 21:52:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572206628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:03,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:52:03,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398367184] [2024-11-19 21:52:03,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:03,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:52:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:52:03,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:52:03,174 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-19 21:52:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:04,815 INFO L93 Difference]: Finished difference Result 788 states and 1197 transitions. [2024-11-19 21:52:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:52:04,816 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-19 21:52:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:04,818 INFO L225 Difference]: With dead ends: 788 [2024-11-19 21:52:04,819 INFO L226 Difference]: Without dead ends: 443 [2024-11-19 21:52:04,820 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-19 21:52:04,820 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 767 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:04,820 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.4s Time] [2024-11-19 21:52:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-19 21:52:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-11-19 21:52:04,837 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-19 21:52:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 561 transitions. [2024-11-19 21:52:04,840 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 561 transitions. Word has length 110 [2024-11-19 21:52:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:04,840 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 561 transitions. [2024-11-19 21:52:04,840 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-19 21:52:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 561 transitions. [2024-11-19 21:52:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:52:04,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:04,842 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-19 21:52:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:52:04,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash -499579042, now seen corresponding path program 2 times [2024-11-19 21:52:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724571059] [2024-11-19 21:52:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:52:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:52:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:52:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:52:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:52:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:52:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:05,009 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-19 21:52:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724571059] [2024-11-19 21:52:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724571059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:52:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236555894] [2024-11-19 21:52:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:52:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:52:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:52:05,011 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-19 21:52:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:06,654 INFO L93 Difference]: Finished difference Result 790 states and 1203 transitions. [2024-11-19 21:52:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:52:06,655 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-19 21:52:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:06,657 INFO L225 Difference]: With dead ends: 790 [2024-11-19 21:52:06,657 INFO L226 Difference]: Without dead ends: 445 [2024-11-19 21:52:06,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:52:06,659 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 764 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-19 21:52:06,659 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-19 21:52:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-19 21:52:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 374. [2024-11-19 21:52:06,691 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-19 21:52:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 567 transitions. [2024-11-19 21:52:06,693 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 567 transitions. Word has length 111 [2024-11-19 21:52:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:06,693 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 567 transitions. [2024-11-19 21:52:06,693 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-19 21:52:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 567 transitions. [2024-11-19 21:52:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:52:06,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:06,695 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-19 21:52:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:52:06,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1056550783, now seen corresponding path program 1 times [2024-11-19 21:52:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303259997] [2024-11-19 21:52:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:52:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:52:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:52:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:52:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:52:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:52:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,802 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-19 21:52:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:06,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303259997] [2024-11-19 21:52:06,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303259997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:52:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941742830] [2024-11-19 21:52:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:06,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:52:06,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:52:06,805 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-19 21:52:06,809 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-19 21:52:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:06,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:52:07,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:52:07,032 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-19 21:52:07,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:52:07,162 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-19 21:52:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941742830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:52:07,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:52:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-19 21:52:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699676751] [2024-11-19 21:52:07,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:52:07,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:52:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:52:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:52:07,166 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-19 21:52:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:08,698 INFO L93 Difference]: Finished difference Result 944 states and 1501 transitions. [2024-11-19 21:52:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:52:08,698 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-19 21:52:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:08,702 INFO L225 Difference]: With dead ends: 944 [2024-11-19 21:52:08,702 INFO L226 Difference]: Without dead ends: 772 [2024-11-19 21:52:08,703 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-19 21:52:08,703 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1056 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:08,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1452 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 21:52:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-19 21:52:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 677. [2024-11-19 21:52:08,727 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-19 21:52:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1103 transitions. [2024-11-19 21:52:08,730 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1103 transitions. Word has length 112 [2024-11-19 21:52:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1103 transitions. [2024-11-19 21:52:08,731 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-19 21:52:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1103 transitions. [2024-11-19 21:52:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:52:08,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:08,733 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-19 21:52:08,741 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-19 21:52:08,934 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-19 21:52:08,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 88149732, now seen corresponding path program 1 times [2024-11-19 21:52:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099474110] [2024-11-19 21:52:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:52:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:08,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:52:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:52:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:52:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:52:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:52:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,007 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-19 21:52:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099474110] [2024-11-19 21:52:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099474110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:09,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:09,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191374720] [2024-11-19 21:52:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:09,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:09,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:09,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:09,009 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-19 21:52:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:09,885 INFO L93 Difference]: Finished difference Result 1665 states and 2780 transitions. [2024-11-19 21:52:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:09,886 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-19 21:52:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:09,890 INFO L225 Difference]: With dead ends: 1665 [2024-11-19 21:52:09,891 INFO L226 Difference]: Without dead ends: 1056 [2024-11-19 21:52:09,892 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-19 21:52:09,893 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-19 21:52:09,893 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-19 21:52:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-19 21:52:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 977. [2024-11-19 21:52:09,921 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-19 21:52:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1626 transitions. [2024-11-19 21:52:09,925 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1626 transitions. Word has length 118 [2024-11-19 21:52:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1626 transitions. [2024-11-19 21:52:09,925 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-19 21:52:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1626 transitions. [2024-11-19 21:52:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 21:52:09,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:09,929 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-19 21:52:09,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:52:09,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 418572611, now seen corresponding path program 1 times [2024-11-19 21:52:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59115925] [2024-11-19 21:52:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:52:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:52:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:52:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:52:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:52:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:52:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:10,006 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-19 21:52:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59115925] [2024-11-19 21:52:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59115925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032204198] [2024-11-19 21:52:10,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:10,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:10,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:10,007 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-19 21:52:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:10,832 INFO L93 Difference]: Finished difference Result 2380 states and 4025 transitions. [2024-11-19 21:52:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:10,832 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-19 21:52:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:10,839 INFO L225 Difference]: With dead ends: 2380 [2024-11-19 21:52:10,840 INFO L226 Difference]: Without dead ends: 1524 [2024-11-19 21:52:10,843 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-19 21:52:10,843 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 858 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:10,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 657 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:52:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-19 21:52:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1445. [2024-11-19 21:52:10,947 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-19 21:52:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2423 transitions. [2024-11-19 21:52:10,958 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2423 transitions. Word has length 119 [2024-11-19 21:52:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2423 transitions. [2024-11-19 21:52:10,962 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-19 21:52:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2423 transitions. [2024-11-19 21:52:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 21:52:10,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:10,972 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-19 21:52:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:52:10,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2089768670, now seen corresponding path program 1 times [2024-11-19 21:52:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230004253] [2024-11-19 21:52:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:52:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:52:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:52:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:52:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:52:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:52:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:11,045 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-19 21:52:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230004253] [2024-11-19 21:52:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230004253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374820981] [2024-11-19 21:52:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:11,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:11,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:11,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:11,046 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-19 21:52:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:11,911 INFO L93 Difference]: Finished difference Result 3427 states and 5866 transitions. [2024-11-19 21:52:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:11,911 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-19 21:52:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:11,942 INFO L225 Difference]: With dead ends: 3427 [2024-11-19 21:52:11,942 INFO L226 Difference]: Without dead ends: 2228 [2024-11-19 21:52:11,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:52:11,946 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 856 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:11,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 646 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:52:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-19 21:52:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2149. [2024-11-19 21:52:12,002 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-19 21:52:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3632 transitions. [2024-11-19 21:52:12,009 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3632 transitions. Word has length 120 [2024-11-19 21:52:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:12,009 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3632 transitions. [2024-11-19 21:52:12,009 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-19 21:52:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3632 transitions. [2024-11-19 21:52:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 21:52:12,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:12,016 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-19 21:52:12,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:52:12,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:12,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1022927198, now seen corresponding path program 1 times [2024-11-19 21:52:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:12,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601539550] [2024-11-19 21:52:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:12,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:52:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:52:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:52:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:52:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:52:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:52:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:52:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601539550] [2024-11-19 21:52:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601539550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321729341] [2024-11-19 21:52:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:12,089 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-19 21:52:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:13,019 INFO L93 Difference]: Finished difference Result 5046 states and 8720 transitions. [2024-11-19 21:52:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:13,019 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-19 21:52:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:13,039 INFO L225 Difference]: With dead ends: 5046 [2024-11-19 21:52:13,040 INFO L226 Difference]: Without dead ends: 3347 [2024-11-19 21:52:13,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:52:13,048 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 854 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:13,048 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.8s Time] [2024-11-19 21:52:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2024-11-19 21:52:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3268. [2024-11-19 21:52:13,177 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-19 21:52:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5547 transitions. [2024-11-19 21:52:13,187 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5547 transitions. Word has length 121 [2024-11-19 21:52:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5547 transitions. [2024-11-19 21:52:13,188 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-19 21:52:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5547 transitions. [2024-11-19 21:52:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 21:52:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:13,196 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-19 21:52:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:52:13,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1502297978, now seen corresponding path program 1 times [2024-11-19 21:52:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872307316] [2024-11-19 21:52:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:52:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:52:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:52:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:52:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:52:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:52:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:13,272 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-19 21:52:13,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:13,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872307316] [2024-11-19 21:52:13,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872307316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:13,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:13,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127579855] [2024-11-19 21:52:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:13,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:13,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:13,274 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-19 21:52:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:14,162 INFO L93 Difference]: Finished difference Result 7964 states and 13819 transitions. [2024-11-19 21:52:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:14,163 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-19 21:52:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:14,184 INFO L225 Difference]: With dead ends: 7964 [2024-11-19 21:52:14,185 INFO L226 Difference]: Without dead ends: 5378 [2024-11-19 21:52:14,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:52:14,193 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.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:14,193 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.7s Time] [2024-11-19 21:52:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2024-11-19 21:52:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5299. [2024-11-19 21:52:14,379 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-19 21:52:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 8995 transitions. [2024-11-19 21:52:14,390 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 8995 transitions. Word has length 122 [2024-11-19 21:52:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:14,390 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 8995 transitions. [2024-11-19 21:52:14,391 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-19 21:52:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 8995 transitions. [2024-11-19 21:52:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 21:52:14,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:14,402 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-19 21:52:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:52:14,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:14,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1397339966, now seen corresponding path program 1 times [2024-11-19 21:52:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721839402] [2024-11-19 21:52:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:52:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:52:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:52:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:52:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:52:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:52:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:14,503 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-19 21:52:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721839402] [2024-11-19 21:52:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721839402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589355810] [2024-11-19 21:52:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:14,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:14,508 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-19 21:52:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:15,568 INFO L93 Difference]: Finished difference Result 13106 states and 22728 transitions. [2024-11-19 21:52:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:15,569 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-19 21:52:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:15,614 INFO L225 Difference]: With dead ends: 13106 [2024-11-19 21:52:15,614 INFO L226 Difference]: Without dead ends: 8866 [2024-11-19 21:52:15,626 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-19 21:52:15,627 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.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:15,627 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.9s Time] [2024-11-19 21:52:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2024-11-19 21:52:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8787. [2024-11-19 21:52:16,015 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-19 21:52:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 14919 transitions. [2024-11-19 21:52:16,043 INFO L78 Accepts]: Start accepts. Automaton has 8787 states and 14919 transitions. Word has length 123 [2024-11-19 21:52:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:16,043 INFO L471 AbstractCegarLoop]: Abstraction has 8787 states and 14919 transitions. [2024-11-19 21:52:16,044 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-19 21:52:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 8787 states and 14919 transitions. [2024-11-19 21:52:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:52:16,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:16,061 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-19 21:52:16,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:52:16,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 213501156, now seen corresponding path program 1 times [2024-11-19 21:52:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:16,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093294516] [2024-11-19 21:52:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:52:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:52:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:52:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:52:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:52:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:52:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:52:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093294516] [2024-11-19 21:52:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093294516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:16,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404815864] [2024-11-19 21:52:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:16,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:16,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:16,141 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-19 21:52:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:17,204 INFO L93 Difference]: Finished difference Result 22765 states and 39434 transitions. [2024-11-19 21:52:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:17,205 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-19 21:52:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:17,267 INFO L225 Difference]: With dead ends: 22765 [2024-11-19 21:52:17,267 INFO L226 Difference]: Without dead ends: 15459 [2024-11-19 21:52:17,291 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-19 21:52:17,291 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 848 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:17,292 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.8s Time] [2024-11-19 21:52:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2024-11-19 21:52:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15380. [2024-11-19 21:52:17,808 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-19 21:52:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15380 states to 15380 states and 26035 transitions. [2024-11-19 21:52:17,844 INFO L78 Accepts]: Start accepts. Automaton has 15380 states and 26035 transitions. Word has length 124 [2024-11-19 21:52:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 15380 states and 26035 transitions. [2024-11-19 21:52:17,845 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-19 21:52:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15380 states and 26035 transitions. [2024-11-19 21:52:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 21:52:17,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:17,872 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-19 21:52:17,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:52:17,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1851360003, now seen corresponding path program 1 times [2024-11-19 21:52:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757119372] [2024-11-19 21:52:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:52:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:52:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:52:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:52:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:52:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:52:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:17,948 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-19 21:52:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757119372] [2024-11-19 21:52:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757119372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:17,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:17,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019053713] [2024-11-19 21:52:17,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:17,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:17,950 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-19 21:52:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:19,459 INFO L93 Difference]: Finished difference Result 40721 states and 70417 transitions. [2024-11-19 21:52:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:19,459 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-19 21:52:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:19,555 INFO L225 Difference]: With dead ends: 40721 [2024-11-19 21:52:19,556 INFO L226 Difference]: Without dead ends: 27429 [2024-11-19 21:52:19,588 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-19 21:52:19,588 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 846 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:19,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 647 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:52:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2024-11-19 21:52:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 27350. [2024-11-19 21:52:20,469 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-19 21:52:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 46195 transitions. [2024-11-19 21:52:20,800 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 46195 transitions. Word has length 125 [2024-11-19 21:52:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 27350 states and 46195 transitions. [2024-11-19 21:52:20,801 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-19 21:52:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 46195 transitions. [2024-11-19 21:52:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 21:52:20,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:20,824 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-19 21:52:20,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:52:20,824 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1715555102, now seen corresponding path program 1 times [2024-11-19 21:52:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617301192] [2024-11-19 21:52:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:52:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:52:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:52:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:52:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:52:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:52:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:20,906 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-19 21:52:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617301192] [2024-11-19 21:52:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617301192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582257758] [2024-11-19 21:52:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:20,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:20,909 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-19 21:52:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:22,790 INFO L93 Difference]: Finished difference Result 74508 states and 128016 transitions. [2024-11-19 21:52:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:22,791 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-19 21:52:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:23,110 INFO L225 Difference]: With dead ends: 74508 [2024-11-19 21:52:23,110 INFO L226 Difference]: Without dead ends: 49978 [2024-11-19 21:52:23,373 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-19 21:52:23,377 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 844 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:23,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 671 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:52:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2024-11-19 21:52:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49899. [2024-11-19 21:52:25,379 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-19 21:52:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49899 states to 49899 states and 83998 transitions. [2024-11-19 21:52:25,584 INFO L78 Accepts]: Start accepts. Automaton has 49899 states and 83998 transitions. Word has length 126 [2024-11-19 21:52:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 49899 states and 83998 transitions. [2024-11-19 21:52:25,585 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-19 21:52:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49899 states and 83998 transitions. [2024-11-19 21:52:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 21:52:25,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:25,615 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-19 21:52:25,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:52:25,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 425305917, now seen corresponding path program 1 times [2024-11-19 21:52:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:25,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70857707] [2024-11-19 21:52:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:52:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:52:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:52:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:52:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:52:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:52:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:25,713 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-19 21:52:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70857707] [2024-11-19 21:52:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70857707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:52:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537622436] [2024-11-19 21:52:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:25,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:52:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:52:25,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:52:25,716 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-19 21:52:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:28,384 INFO L93 Difference]: Finished difference Result 92994 states and 160147 transitions. [2024-11-19 21:52:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:52:28,384 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-19 21:52:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:28,713 INFO L225 Difference]: With dead ends: 92994 [2024-11-19 21:52:28,713 INFO L226 Difference]: Without dead ends: 92822 [2024-11-19 21:52:28,758 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-19 21:52:28,759 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 839 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:28,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 655 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 21:52:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92822 states. [2024-11-19 21:52:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92822 to 92743. [2024-11-19 21:52:31,666 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-19 21:52:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92743 states to 92743 states and 155428 transitions. [2024-11-19 21:52:32,319 INFO L78 Accepts]: Start accepts. Automaton has 92743 states and 155428 transitions. Word has length 127 [2024-11-19 21:52:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:32,319 INFO L471 AbstractCegarLoop]: Abstraction has 92743 states and 155428 transitions. [2024-11-19 21:52:32,320 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-19 21:52:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 92743 states and 155428 transitions. [2024-11-19 21:52:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 21:52:32,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:32,350 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-19 21:52:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:52:32,350 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1225218141, now seen corresponding path program 1 times [2024-11-19 21:52:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154096466] [2024-11-19 21:52:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:52:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:52:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:52:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:52:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:52:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:52:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:32,609 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-19 21:52:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154096466] [2024-11-19 21:52:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154096466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:32,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:32,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 21:52:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371217901] [2024-11-19 21:52:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:32,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 21:52:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:32,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 21:52:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-19 21:52:32,610 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-19 21:52:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:40,606 INFO L93 Difference]: Finished difference Result 185256 states and 322377 transitions. [2024-11-19 21:52:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 21:52:40,607 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-19 21:52:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:41,502 INFO L225 Difference]: With dead ends: 185256 [2024-11-19 21:52:41,503 INFO L226 Difference]: Without dead ends: 185092 [2024-11-19 21:52:41,608 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-19 21:52:41,609 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 3364 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 6497 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3364 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 7543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:41,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3364 Valid, 2507 Invalid, 7543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 6497 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 21:52:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185092 states. [2024-11-19 21:52:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185092 to 184738. [2024-11-19 21:52:48,464 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-19 21:52:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184738 states to 184738 states and 312973 transitions. [2024-11-19 21:52:49,791 INFO L78 Accepts]: Start accepts. Automaton has 184738 states and 312973 transitions. Word has length 128 [2024-11-19 21:52:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:52:49,792 INFO L471 AbstractCegarLoop]: Abstraction has 184738 states and 312973 transitions. [2024-11-19 21:52:49,792 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-19 21:52:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 184738 states and 312973 transitions. [2024-11-19 21:52:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 21:52:49,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:52:49,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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:52:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:52:49,864 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:52:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:52:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 119811374, now seen corresponding path program 1 times [2024-11-19 21:52:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:52:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465527817] [2024-11-19 21:52:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:52:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:52:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:52:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:52:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:52:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:52:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:52:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:52:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:52:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:52:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:52:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:52:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:52:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:52:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:52:50,087 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-19 21:52:50,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:52:50,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465527817] [2024-11-19 21:52:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465527817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:52:50,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:52:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 21:52:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593316420] [2024-11-19 21:52:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:52:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:52:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:52:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:52:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:52:50,090 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-19 21:52:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:52:56,403 INFO L93 Difference]: Finished difference Result 185830 states and 321072 transitions. [2024-11-19 21:52:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 21:52:56,404 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-19 21:52:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:52:57,400 INFO L225 Difference]: With dead ends: 185830 [2024-11-19 21:52:57,400 INFO L226 Difference]: Without dead ends: 185054 [2024-11-19 21:52:57,462 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-19 21:52:57,462 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1539 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:52:57,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1430 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 21:52:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185054 states. [2024-11-19 21:53:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185054 to 184829. [2024-11-19 21:53:03,730 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)