./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_spec6_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6a023004d1923934c700fbd43377f50b99f9b3dcadd2a9eb1f89b20b18aa1436 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:50:26,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:50:26,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:50:26,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:50:26,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:50:26,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:50:26,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:50:26,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:50:26,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:50:26,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:50:26,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:50:26,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:50:26,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:50:26,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:50:26,535 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:50:26,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:50:26,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:50:26,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:50:26,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:50:26,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:50:26,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:50:26,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:50:26,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:50:26,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:50:26,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:50:26,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:50:26,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:50:26,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:50:26,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:50:26,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:50:26,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:50:26,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:50:26,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:26,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:50:26,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:50:26,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:50:26,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:50:26,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:50:26,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:50:26,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:50:26,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:50:26,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:50:26,555 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-clean/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-clean/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 -> 6a023004d1923934c700fbd43377f50b99f9b3dcadd2a9eb1f89b20b18aa1436 [2024-10-11 02:50:26,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:50:26,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:50:26,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:50:26,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:50:26,827 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:50:26,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c [2024-10-11 02:50:28,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:50:28,543 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:50:28,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c [2024-10-11 02:50:28,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc155640f/7afffb48611d47a68b96425088ff6fe7/FLAG856e87bc9 [2024-10-11 02:50:28,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc155640f/7afffb48611d47a68b96425088ff6fe7 [2024-10-11 02:50:28,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:50:28,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:50:28,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:28,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:50:28,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:50:28,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:28" (1/1) ... [2024-10-11 02:50:28,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47dc5bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:28, skipping insertion in model container [2024-10-11 02:50:28,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:28" (1/1) ... [2024-10-11 02:50:28,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:50:29,155 WARN L248 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_spec6_product12.cil.c[52000,52013] [2024-10-11 02:50:29,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:29,213 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:50:29,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-11 02:50:29,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [97] [2024-10-11 02:50:29,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [210] [2024-10-11 02:50:29,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [576] [2024-10-11 02:50:29,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [864] [2024-10-11 02:50:29,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1937] [2024-10-11 02:50:29,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2342] [2024-10-11 02:50:29,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2351] [2024-10-11 02:50:29,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2583] [2024-10-11 02:50:29,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2629] [2024-10-11 02:50:29,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2646] [2024-10-11 02:50:29,300 WARN L248 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_spec6_product12.cil.c[52000,52013] [2024-10-11 02:50:29,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:50:29,355 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:50:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29 WrapperNode [2024-10-11 02:50:29,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:50:29,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:29,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:50:29,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:50:29,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,444 INFO L138 Inliner]: procedures = 123, calls = 179, calls flagged for inlining = 49, calls inlined = 39, statements flattened = 811 [2024-10-11 02:50:29,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:50:29,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:50:29,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:50:29,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:50:29,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,494 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-10-11 02:50:29,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:50:29,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:50:29,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:50:29,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:50:29,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (1/1) ... [2024-10-11 02:50:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:50:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:29,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:50:29,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:50:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:50:29,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:50:29,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:50:29,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:50:29,627 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:50:29,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:50:29,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:50:29,628 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:50:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:50:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:50:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:50:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:50:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:50:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:50:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:50:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:50:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:50:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:50:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:50:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:50:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:50:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:50:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:50:29,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:50:29,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:50:29,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:50:30,656 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2024-10-11 02:50:30,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:50:30,721 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:50:30,723 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:50:30,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:30 BoogieIcfgContainer [2024-10-11 02:50:30,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:50:30,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:50:30,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:50:30,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:50:30,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:50:28" (1/3) ... [2024-10-11 02:50:30,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10033303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:30, skipping insertion in model container [2024-10-11 02:50:30,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:29" (2/3) ... [2024-10-11 02:50:30,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10033303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:30, skipping insertion in model container [2024-10-11 02:50:30,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:30" (3/3) ... [2024-10-11 02:50:30,734 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec6_product12.cil.c [2024-10-11 02:50:30,752 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:50:30,752 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:50:30,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:50:30,846 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;@4e51fac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:50:30,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:50:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 190 states have (on average 1.6) internal successors, (304), 194 states have internal predecessors, (304), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 02:50:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:50:30,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:30,871 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:30,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -306622727, now seen corresponding path program 1 times [2024-10-11 02:50:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819580910] [2024-10-11 02:50:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:50:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:50:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:50:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:50:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819580910] [2024-10-11 02:50:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819580910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305457483] [2024-10-11 02:50:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:31,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:31,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:50:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:50:32,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:50:32,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305457483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-11 02:50:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970184347] [2024-10-11 02:50:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:32,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:50:32,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:50:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:50:32,124 INFO L87 Difference]: Start difference. First operand has 252 states, 190 states have (on average 1.6) internal successors, (304), 194 states have internal predecessors, (304), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:32,223 INFO L93 Difference]: Finished difference Result 363 states and 550 transitions. [2024-10-11 02:50:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:50:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2024-10-11 02:50:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:32,240 INFO L225 Difference]: With dead ends: 363 [2024-10-11 02:50:32,240 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 02:50:32,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 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-10-11 02:50:32,249 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:32,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 02:50:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-10-11 02:50:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 188 states have (on average 1.5797872340425532) internal successors, (297), 191 states have internal predecessors, (297), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 02:50:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 382 transitions. [2024-10-11 02:50:32,308 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 382 transitions. Word has length 104 [2024-10-11 02:50:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 382 transitions. [2024-10-11 02:50:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 382 transitions. [2024-10-11 02:50:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:50:32,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:32,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-11 02:50:32,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:50:32,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:50:32,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:32,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1081114270, now seen corresponding path program 1 times [2024-10-11 02:50:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145434596] [2024-10-11 02:50:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:50:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:50:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:50:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:50:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145434596] [2024-10-11 02:50:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145434596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836751239] [2024-10-11 02:50:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:32,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:32,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:50:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:50:33,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:50:33,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836751239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:33,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:50:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649872919] [2024-10-11 02:50:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:33,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:50:33,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:50:33,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:33,129 INFO L87 Difference]: Start difference. First operand 249 states and 382 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:33,188 INFO L93 Difference]: Finished difference Result 359 states and 537 transitions. [2024-10-11 02:50:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:50:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-11 02:50:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:33,197 INFO L225 Difference]: With dead ends: 359 [2024-10-11 02:50:33,197 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 02:50:33,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 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-10-11 02:50:33,202 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:33,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 745 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 02:50:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-11 02:50:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 190 states have (on average 1.5736842105263158) internal successors, (299), 193 states have internal predecessors, (299), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 02:50:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 384 transitions. [2024-10-11 02:50:33,234 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 384 transitions. Word has length 105 [2024-10-11 02:50:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:33,235 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 384 transitions. [2024-10-11 02:50:33,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 384 transitions. [2024-10-11 02:50:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:50:33,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:33,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-11 02:50:33,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:50:33,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:33,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:33,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash -188517010, now seen corresponding path program 1 times [2024-10-11 02:50:33,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960121309] [2024-10-11 02:50:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:50:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:50:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:50:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:50:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960121309] [2024-10-11 02:50:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960121309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862569695] [2024-10-11 02:50:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:33,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:50:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:33,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:50:34,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:50:34,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862569695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:34,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:50:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644581496] [2024-10-11 02:50:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:34,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:50:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:50:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:50:34,029 INFO L87 Difference]: Start difference. First operand 251 states and 384 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:34,096 INFO L93 Difference]: Finished difference Result 528 states and 820 transitions. [2024-10-11 02:50:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:50:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-11 02:50:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:34,102 INFO L225 Difference]: With dead ends: 528 [2024-10-11 02:50:34,103 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 02:50:34,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 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-10-11 02:50:34,105 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 95 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:34,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 712 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:50:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 02:50:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2024-10-11 02:50:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 225 states have internal predecessors, (352), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:50:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 459 transitions. [2024-10-11 02:50:34,132 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 459 transitions. Word has length 110 [2024-10-11 02:50:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:34,133 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 459 transitions. [2024-10-11 02:50:34,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 459 transitions. [2024-10-11 02:50:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:50:34,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:34,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-11 02:50:34,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:50:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:34,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2121442329, now seen corresponding path program 1 times [2024-10-11 02:50:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726183229] [2024-10-11 02:50:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:50:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:50:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:50:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:50:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:50:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:50:34,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:34,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726183229] [2024-10-11 02:50:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726183229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:34,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534463897] [2024-10-11 02:50:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:34,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:34,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:34,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:50:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:34,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:50:34,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:50:34,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534463897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:34,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 02:50:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909532782] [2024-10-11 02:50:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:34,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:50:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:50:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:50:34,923 INFO L87 Difference]: Start difference. First operand 294 states and 459 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:35,020 INFO L93 Difference]: Finished difference Result 583 states and 912 transitions. [2024-10-11 02:50:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:50:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2024-10-11 02:50:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:35,024 INFO L225 Difference]: With dead ends: 583 [2024-10-11 02:50:35,024 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 02:50:35,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 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-10-11 02:50:35,027 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 2 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:35,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1449 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:50:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 02:50:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-10-11 02:50:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 223 states have (on average 1.5829596412556053) internal successors, (353), 227 states have internal predecessors, (353), 54 states have call successors, (54), 17 states have call predecessors, (54), 18 states have return successors, (55), 53 states have call predecessors, (55), 53 states have call successors, (55) [2024-10-11 02:50:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2024-10-11 02:50:35,047 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 111 [2024-10-11 02:50:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:35,048 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2024-10-11 02:50:35,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2024-10-11 02:50:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:50:35,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:35,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:50:35,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:35,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -739674531, now seen corresponding path program 1 times [2024-10-11 02:50:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:35,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544580193] [2024-10-11 02:50:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:50:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:50:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:50:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:50:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:50:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:50:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:50:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:50:35,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:35,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544580193] [2024-10-11 02:50:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544580193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:35,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533954152] [2024-10-11 02:50:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:35,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:35,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:50:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:35,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:50:35,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:50:35,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:50:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533954152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:35,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:50:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 02:50:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163228623] [2024-10-11 02:50:35,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:35,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:50:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:50:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:50:35,848 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:35,930 INFO L93 Difference]: Finished difference Result 585 states and 917 transitions. [2024-10-11 02:50:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:50:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2024-10-11 02:50:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:35,933 INFO L225 Difference]: With dead ends: 585 [2024-10-11 02:50:35,934 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 02:50:35,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 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-10-11 02:50:35,936 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 2 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1435 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:50:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 02:50:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-11 02:50:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 229 states have internal predecessors, (354), 54 states have call successors, (54), 17 states have call predecessors, (54), 19 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2024-10-11 02:50:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 468 transitions. [2024-10-11 02:50:35,952 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 468 transitions. Word has length 112 [2024-10-11 02:50:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 468 transitions. [2024-10-11 02:50:35,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 468 transitions. [2024-10-11 02:50:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:50:35,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:35,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:35,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:50:36,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:36,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:36,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 842230276, now seen corresponding path program 1 times [2024-10-11 02:50:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932291434] [2024-10-11 02:50:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:50:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:50:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:50:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:50:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:50:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:50:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:50:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:50:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:50:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:50:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932291434] [2024-10-11 02:50:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932291434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:50:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090935432] [2024-10-11 02:50:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:36,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:50:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:50:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:50:36,362 INFO L87 Difference]: Start difference. First operand 298 states and 468 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:37,587 INFO L93 Difference]: Finished difference Result 623 states and 984 transitions. [2024-10-11 02:50:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-10-11 02:50:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:37,590 INFO L225 Difference]: With dead ends: 623 [2024-10-11 02:50:37,591 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 02:50:37,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 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-10-11 02:50:37,593 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 566 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:37,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 817 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:50:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 02:50:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 298. [2024-10-11 02:50:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 229 states have internal predecessors, (354), 54 states have call successors, (54), 17 states have call predecessors, (54), 19 states have return successors, (59), 53 states have call predecessors, (59), 53 states have call successors, (59) [2024-10-11 02:50:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 467 transitions. [2024-10-11 02:50:37,622 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 467 transitions. Word has length 113 [2024-10-11 02:50:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:37,623 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 467 transitions. [2024-10-11 02:50:37,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 467 transitions. [2024-10-11 02:50:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:50:37,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:37,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:37,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:50:37,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -832509480, now seen corresponding path program 2 times [2024-10-11 02:50:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774189486] [2024-10-11 02:50:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:50:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:50:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:50:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:50:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:50:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:50:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:50:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:50:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:50:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:50:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774189486] [2024-10-11 02:50:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774189486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:50:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560182884] [2024-10-11 02:50:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:50:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:50:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:50:37,839 INFO L87 Difference]: Start difference. First operand 298 states and 467 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:38,998 INFO L93 Difference]: Finished difference Result 625 states and 987 transitions. [2024-10-11 02:50:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:50:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2024-10-11 02:50:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:39,002 INFO L225 Difference]: With dead ends: 625 [2024-10-11 02:50:39,002 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 02:50:39,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 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-10-11 02:50:39,004 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 563 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:39,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 817 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:50:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 02:50:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 300. [2024-10-11 02:50:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 225 states have (on average 1.5777777777777777) internal successors, (355), 231 states have internal predecessors, (355), 54 states have call successors, (54), 17 states have call predecessors, (54), 20 states have return successors, (61), 53 states have call predecessors, (61), 53 states have call successors, (61) [2024-10-11 02:50:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 470 transitions. [2024-10-11 02:50:39,033 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 470 transitions. Word has length 114 [2024-10-11 02:50:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:39,033 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 470 transitions. [2024-10-11 02:50:39,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:50:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 470 transitions. [2024-10-11 02:50:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:50:39,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:39,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:39,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:50:39,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:39,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash -45177527, now seen corresponding path program 1 times [2024-10-11 02:50:39,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099358747] [2024-10-11 02:50:39,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:50:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:50:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:50:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:50:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:50:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:50:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:50:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:50:39,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:39,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099358747] [2024-10-11 02:50:39,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099358747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:39,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:39,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:50:39,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953546343] [2024-10-11 02:50:39,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:39,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:50:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:39,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:50:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:50:39,254 INFO L87 Difference]: Start difference. First operand 300 states and 470 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:50:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:40,849 INFO L93 Difference]: Finished difference Result 623 states and 982 transitions. [2024-10-11 02:50:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:50:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 115 [2024-10-11 02:50:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:40,853 INFO L225 Difference]: With dead ends: 623 [2024-10-11 02:50:40,853 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 02:50:40,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 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-10-11 02:50:40,855 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 566 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:40,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1174 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:50:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 02:50:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 300. [2024-10-11 02:50:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 225 states have (on average 1.5777777777777777) internal successors, (355), 231 states have internal predecessors, (355), 54 states have call successors, (54), 17 states have call predecessors, (54), 20 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2024-10-11 02:50:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 469 transitions. [2024-10-11 02:50:40,880 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 469 transitions. Word has length 115 [2024-10-11 02:50:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:40,881 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 469 transitions. [2024-10-11 02:50:40,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:50:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 469 transitions. [2024-10-11 02:50:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:50:40,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:40,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:40,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:50:40,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -695977524, now seen corresponding path program 2 times [2024-10-11 02:50:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178905609] [2024-10-11 02:50:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:50:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:50:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:50:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:50:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178905609] [2024-10-11 02:50:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178905609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:41,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:50:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985139120] [2024-10-11 02:50:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:50:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:50:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:50:41,152 INFO L87 Difference]: Start difference. First operand 300 states and 469 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:50:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:42,765 INFO L93 Difference]: Finished difference Result 625 states and 988 transitions. [2024-10-11 02:50:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:50:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-10-11 02:50:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:42,768 INFO L225 Difference]: With dead ends: 625 [2024-10-11 02:50:42,768 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 02:50:42,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:50:42,772 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 563 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:42,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1175 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:50:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 02:50:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 302. [2024-10-11 02:50:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 226 states have (on average 1.575221238938053) internal successors, (356), 233 states have internal predecessors, (356), 54 states have call successors, (54), 17 states have call predecessors, (54), 21 states have return successors, (65), 53 states have call predecessors, (65), 53 states have call successors, (65) [2024-10-11 02:50:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 475 transitions. [2024-10-11 02:50:42,796 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 475 transitions. Word has length 116 [2024-10-11 02:50:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:42,796 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 475 transitions. [2024-10-11 02:50:42,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:50:42,797 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 475 transitions. [2024-10-11 02:50:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:50:42,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:42,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:42,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:50:42,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash 671723054, now seen corresponding path program 1 times [2024-10-11 02:50:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485166200] [2024-10-11 02:50:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:50:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485166200] [2024-10-11 02:50:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485166200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:50:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115102041] [2024-10-11 02:50:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:42,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:50:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:50:42,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:50:42,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:50:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:43,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:50:43,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:50:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:43,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:50:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115102041] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:50:43,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:50:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-11 02:50:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220703285] [2024-10-11 02:50:43,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:50:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:50:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:50:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:50:43,359 INFO L87 Difference]: Start difference. First operand 302 states and 475 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (32), 5 states have call predecessors, (32), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 02:50:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:44,622 INFO L93 Difference]: Finished difference Result 766 states and 1273 transitions. [2024-10-11 02:50:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:50:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (32), 5 states have call predecessors, (32), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 117 [2024-10-11 02:50:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:44,627 INFO L225 Difference]: With dead ends: 766 [2024-10-11 02:50:44,627 INFO L226 Difference]: Without dead ends: 658 [2024-10-11 02:50:44,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 259 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-10-11 02:50:44,628 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 890 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1131 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:50:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-10-11 02:50:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 597. [2024-10-11 02:50:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 457 states have (on average 1.6323851203501094) internal successors, (746), 464 states have internal predecessors, (746), 118 states have call successors, (118), 17 states have call predecessors, (118), 21 states have return successors, (139), 117 states have call predecessors, (139), 117 states have call successors, (139) [2024-10-11 02:50:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1003 transitions. [2024-10-11 02:50:44,677 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1003 transitions. Word has length 117 [2024-10-11 02:50:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 1003 transitions. [2024-10-11 02:50:44,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (32), 5 states have call predecessors, (32), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 02:50:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1003 transitions. [2024-10-11 02:50:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 02:50:44,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:44,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:44,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:50:44,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:50:44,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 602327563, now seen corresponding path program 1 times [2024-10-11 02:50:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845654258] [2024-10-11 02:50:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:50:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:50:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:50:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845654258] [2024-10-11 02:50:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845654258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443102939] [2024-10-11 02:50:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:44,996 INFO L87 Difference]: Start difference. First operand 597 states and 1003 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:45,824 INFO L93 Difference]: Finished difference Result 1477 states and 2542 transitions. [2024-10-11 02:50:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-10-11 02:50:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:45,831 INFO L225 Difference]: With dead ends: 1477 [2024-10-11 02:50:45,832 INFO L226 Difference]: Without dead ends: 940 [2024-10-11 02:50:45,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:45,835 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 655 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:45,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 584 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-10-11 02:50:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 889. [2024-10-11 02:50:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 685 states have (on average 1.6394160583941606) internal successors, (1123), 692 states have internal predecessors, (1123), 182 states have call successors, (182), 17 states have call predecessors, (182), 21 states have return successors, (213), 181 states have call predecessors, (213), 181 states have call successors, (213) [2024-10-11 02:50:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1518 transitions. [2024-10-11 02:50:45,882 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1518 transitions. Word has length 123 [2024-10-11 02:50:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:45,882 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1518 transitions. [2024-10-11 02:50:45,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1518 transitions. [2024-10-11 02:50:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:50:45,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:45,888 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:45,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:50:45,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:45,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1204130439, now seen corresponding path program 1 times [2024-10-11 02:50:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931184781] [2024-10-11 02:50:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:50:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:50:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:50:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:50:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:50:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:50:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931184781] [2024-10-11 02:50:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931184781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406624060] [2024-10-11 02:50:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:45,993 INFO L87 Difference]: Start difference. First operand 889 states and 1518 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:46,867 INFO L93 Difference]: Finished difference Result 2174 states and 3769 transitions. [2024-10-11 02:50:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-10-11 02:50:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:46,876 INFO L225 Difference]: With dead ends: 2174 [2024-10-11 02:50:46,877 INFO L226 Difference]: Without dead ends: 1395 [2024-10-11 02:50:46,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:46,881 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 653 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:46,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 576 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:50:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-10-11 02:50:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1344. [2024-10-11 02:50:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1045 states have (on average 1.6430622009569378) internal successors, (1717), 1052 states have internal predecessors, (1717), 277 states have call successors, (277), 17 states have call predecessors, (277), 21 states have return successors, (308), 276 states have call predecessors, (308), 276 states have call successors, (308) [2024-10-11 02:50:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2302 transitions. [2024-10-11 02:50:46,942 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2302 transitions. Word has length 124 [2024-10-11 02:50:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:46,943 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2302 transitions. [2024-10-11 02:50:46,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2302 transitions. [2024-10-11 02:50:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 02:50:46,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:46,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:46,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:50:46,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash -890665875, now seen corresponding path program 1 times [2024-10-11 02:50:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032658548] [2024-10-11 02:50:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:50:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:50:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:50:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:50:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:50:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032658548] [2024-10-11 02:50:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032658548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584573628] [2024-10-11 02:50:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:47,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:47,065 INFO L87 Difference]: Start difference. First operand 1344 states and 2302 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:47,878 INFO L93 Difference]: Finished difference Result 3192 states and 5581 transitions. [2024-10-11 02:50:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:47,879 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-10-11 02:50:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:47,893 INFO L225 Difference]: With dead ends: 3192 [2024-10-11 02:50:47,893 INFO L226 Difference]: Without dead ends: 2078 [2024-10-11 02:50:47,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:47,899 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 651 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:47,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 571 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-10-11 02:50:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2027. [2024-10-11 02:50:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1605 states have (on average 1.6467289719626168) internal successors, (2643), 1612 states have internal predecessors, (2643), 400 states have call successors, (400), 17 states have call predecessors, (400), 21 states have return successors, (447), 399 states have call predecessors, (447), 399 states have call successors, (447) [2024-10-11 02:50:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 3490 transitions. [2024-10-11 02:50:47,996 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 3490 transitions. Word has length 125 [2024-10-11 02:50:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 3490 transitions. [2024-10-11 02:50:47,997 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 3490 transitions. [2024-10-11 02:50:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 02:50:48,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:48,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:50:48,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:50:48,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1219674216, now seen corresponding path program 1 times [2024-10-11 02:50:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425406995] [2024-10-11 02:50:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:50:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:50:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:50:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:50:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:50:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:50:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:50:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:50:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425406995] [2024-10-11 02:50:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425406995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:48,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:48,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75909299] [2024-10-11 02:50:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:48,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:48,110 INFO L87 Difference]: Start difference. First operand 2027 states and 3490 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:48,937 INFO L93 Difference]: Finished difference Result 4762 states and 8386 transitions. [2024-10-11 02:50:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:48,937 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-10-11 02:50:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:48,958 INFO L225 Difference]: With dead ends: 4762 [2024-10-11 02:50:48,959 INFO L226 Difference]: Without dead ends: 3162 [2024-10-11 02:50:48,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:48,967 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 649 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:48,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 570 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2024-10-11 02:50:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3111. [2024-10-11 02:50:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2510 states have (on average 1.649003984063745) internal successors, (4139), 2517 states have internal predecessors, (4139), 579 states have call successors, (579), 17 states have call predecessors, (579), 21 states have return successors, (652), 578 states have call predecessors, (652), 578 states have call successors, (652) [2024-10-11 02:50:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 5370 transitions. [2024-10-11 02:50:49,106 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 5370 transitions. Word has length 126 [2024-10-11 02:50:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:49,106 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 5370 transitions. [2024-10-11 02:50:49,107 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 5370 transitions. [2024-10-11 02:50:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:50:49,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:49,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:49,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:50:49,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -525216279, now seen corresponding path program 1 times [2024-10-11 02:50:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:49,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98843087] [2024-10-11 02:50:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:50:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:50:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:50:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:50:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:50:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:50:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:50:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:50:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98843087] [2024-10-11 02:50:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98843087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832886568] [2024-10-11 02:50:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:49,274 INFO L87 Difference]: Start difference. First operand 3111 states and 5370 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:50,104 INFO L93 Difference]: Finished difference Result 7593 states and 13398 transitions. [2024-10-11 02:50:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:50,105 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-11 02:50:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:50,134 INFO L225 Difference]: With dead ends: 7593 [2024-10-11 02:50:50,134 INFO L226 Difference]: Without dead ends: 5132 [2024-10-11 02:50:50,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:50,146 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 647 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:50,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 601 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5132 states. [2024-10-11 02:50:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5132 to 5081. [2024-10-11 02:50:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5081 states, 4104 states have (on average 1.6398635477582846) internal successors, (6730), 4111 states have internal predecessors, (6730), 955 states have call successors, (955), 17 states have call predecessors, (955), 21 states have return successors, (1072), 954 states have call predecessors, (1072), 954 states have call successors, (1072) [2024-10-11 02:50:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 8757 transitions. [2024-10-11 02:50:50,414 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 8757 transitions. Word has length 127 [2024-10-11 02:50:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:50,414 INFO L471 AbstractCegarLoop]: Abstraction has 5081 states and 8757 transitions. [2024-10-11 02:50:50,415 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 8757 transitions. [2024-10-11 02:50:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 02:50:50,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:50,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:50:50,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:50,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 298052332, now seen corresponding path program 1 times [2024-10-11 02:50:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231695900] [2024-10-11 02:50:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:50:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:50:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:50:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:50:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:50:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:50:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:50:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:50:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231695900] [2024-10-11 02:50:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231695900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798278311] [2024-10-11 02:50:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:50,556 INFO L87 Difference]: Start difference. First operand 5081 states and 8757 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:51,495 INFO L93 Difference]: Finished difference Result 12574 states and 22146 transitions. [2024-10-11 02:50:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:51,496 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-10-11 02:50:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:51,556 INFO L225 Difference]: With dead ends: 12574 [2024-10-11 02:50:51,556 INFO L226 Difference]: Without dead ends: 8509 [2024-10-11 02:50:51,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:51,576 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 645 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:51,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 576 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8509 states. [2024-10-11 02:50:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8509 to 8458. [2024-10-11 02:50:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8458 states, 6875 states have (on average 1.6368) internal successors, (11253), 6882 states have internal predecessors, (11253), 1561 states have call successors, (1561), 17 states have call predecessors, (1561), 21 states have return successors, (1756), 1560 states have call predecessors, (1756), 1560 states have call successors, (1756) [2024-10-11 02:50:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 14570 transitions. [2024-10-11 02:50:51,981 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 14570 transitions. Word has length 128 [2024-10-11 02:50:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:51,981 INFO L471 AbstractCegarLoop]: Abstraction has 8458 states and 14570 transitions. [2024-10-11 02:50:51,982 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 14570 transitions. [2024-10-11 02:50:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 02:50:52,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:52,009 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:52,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:50:52,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:52,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1596267989, now seen corresponding path program 1 times [2024-10-11 02:50:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994194535] [2024-10-11 02:50:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:50:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:50:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:50:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:50:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:50:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:50:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:50:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:50:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994194535] [2024-10-11 02:50:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994194535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896734211] [2024-10-11 02:50:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:52,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:52,166 INFO L87 Difference]: Start difference. First operand 8458 states and 14570 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:53,258 INFO L93 Difference]: Finished difference Result 21926 states and 38545 transitions. [2024-10-11 02:50:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:53,258 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-10-11 02:50:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:53,314 INFO L225 Difference]: With dead ends: 21926 [2024-10-11 02:50:53,314 INFO L226 Difference]: Without dead ends: 14893 [2024-10-11 02:50:53,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:53,339 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 643 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:53,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 593 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14893 states. [2024-10-11 02:50:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14893 to 14842. [2024-10-11 02:50:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14842 states, 12056 states have (on average 1.6265759787657599) internal successors, (19610), 12063 states have internal predecessors, (19610), 2764 states have call successors, (2764), 17 states have call predecessors, (2764), 21 states have return successors, (3103), 2763 states have call predecessors, (3103), 2763 states have call successors, (3103) [2024-10-11 02:50:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14842 states to 14842 states and 25477 transitions. [2024-10-11 02:50:53,948 INFO L78 Accepts]: Start accepts. Automaton has 14842 states and 25477 transitions. Word has length 129 [2024-10-11 02:50:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:53,949 INFO L471 AbstractCegarLoop]: Abstraction has 14842 states and 25477 transitions. [2024-10-11 02:50:53,949 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14842 states and 25477 transitions. [2024-10-11 02:50:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 02:50:53,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:53,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:50:53,988 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1907457133, now seen corresponding path program 1 times [2024-10-11 02:50:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956802767] [2024-10-11 02:50:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:50:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:50:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:50:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:50:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:50:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:50:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:50:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:50:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956802767] [2024-10-11 02:50:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956802767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988489274] [2024-10-11 02:50:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:54,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:54,086 INFO L87 Difference]: Start difference. First operand 14842 states and 25477 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:55,418 INFO L93 Difference]: Finished difference Result 39285 states and 68931 transitions. [2024-10-11 02:50:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:55,419 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-10-11 02:50:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:55,551 INFO L225 Difference]: With dead ends: 39285 [2024-10-11 02:50:55,551 INFO L226 Difference]: Without dead ends: 26460 [2024-10-11 02:50:55,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:55,605 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 641 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:55,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 571 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26460 states. [2024-10-11 02:50:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26460 to 26409. [2024-10-11 02:50:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26409 states, 21584 states have (on average 1.6222664936990363) internal successors, (35015), 21591 states have internal predecessors, (35015), 4803 states have call successors, (4803), 17 states have call predecessors, (4803), 21 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2024-10-11 02:50:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26409 states to 26409 states and 45234 transitions. [2024-10-11 02:50:56,656 INFO L78 Accepts]: Start accepts. Automaton has 26409 states and 45234 transitions. Word has length 130 [2024-10-11 02:50:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:50:56,657 INFO L471 AbstractCegarLoop]: Abstraction has 26409 states and 45234 transitions. [2024-10-11 02:50:56,657 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26409 states and 45234 transitions. [2024-10-11 02:50:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:50:56,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:50:56,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:50:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:50:56,698 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:50:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:50:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1185031885, now seen corresponding path program 1 times [2024-10-11 02:50:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:50:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024721519] [2024-10-11 02:50:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:50:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:50:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:50:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:50:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:50:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:50:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:50:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:50:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:50:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:50:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:50:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:50:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:50:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:50:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:50:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:50:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:50:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:50:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:50:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024721519] [2024-10-11 02:50:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024721519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:50:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:50:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:50:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280037933] [2024-10-11 02:50:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:50:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:50:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:50:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:50:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:50:56,793 INFO L87 Difference]: Start difference. First operand 26409 states and 45234 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:50:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:50:58,850 INFO L93 Difference]: Finished difference Result 71897 states and 125355 transitions. [2024-10-11 02:50:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:50:58,851 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2024-10-11 02:50:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:50:59,053 INFO L225 Difference]: With dead ends: 71897 [2024-10-11 02:50:59,054 INFO L226 Difference]: Without dead ends: 48220 [2024-10-11 02:50:59,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:50:59,136 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 639 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:50:59,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 581 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:50:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48220 states. [2024-10-11 02:51:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48220 to 48169. [2024-10-11 02:51:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48169 states, 39629 states have (on average 1.6166696106386738) internal successors, (64067), 39636 states have internal predecessors, (64067), 8518 states have call successors, (8518), 17 states have call predecessors, (8518), 21 states have return successors, (9663), 8517 states have call predecessors, (9663), 8517 states have call successors, (9663) [2024-10-11 02:51:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48169 states to 48169 states and 82248 transitions. [2024-10-11 02:51:01,641 INFO L78 Accepts]: Start accepts. Automaton has 48169 states and 82248 transitions. Word has length 131 [2024-10-11 02:51:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:01,642 INFO L471 AbstractCegarLoop]: Abstraction has 48169 states and 82248 transitions. [2024-10-11 02:51:01,642 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:51:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 48169 states and 82248 transitions. [2024-10-11 02:51:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 02:51:01,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:01,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:51:01,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:51:01,689 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:01,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash 817092301, now seen corresponding path program 1 times [2024-10-11 02:51:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:01,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872381965] [2024-10-11 02:51:01,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:01,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:51:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:51:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:51:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:51:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:51:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:51:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:51:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:51:02,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872381965] [2024-10-11 02:51:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872381965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:02,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:51:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270631422] [2024-10-11 02:51:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:51:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:51:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:51:02,111 INFO L87 Difference]: Start difference. First operand 48169 states and 82248 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:51:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:04,412 INFO L93 Difference]: Finished difference Result 89616 states and 156719 transitions. [2024-10-11 02:51:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:51:04,413 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-10-11 02:51:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:04,985 INFO L225 Difference]: With dead ends: 89616 [2024-10-11 02:51:04,985 INFO L226 Difference]: Without dead ends: 89508 [2024-10-11 02:51:05,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-10-11 02:51:05,036 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 634 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:05,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 583 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:51:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89508 states. [2024-10-11 02:51:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89508 to 89457. [2024-10-11 02:51:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89457 states, 74118 states have (on average 1.609555033864918) internal successors, (119297), 74125 states have internal predecessors, (119297), 15317 states have call successors, (15317), 17 states have call predecessors, (15317), 21 states have return successors, (17508), 15316 states have call predecessors, (17508), 15316 states have call successors, (17508) [2024-10-11 02:51:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89457 states to 89457 states and 152122 transitions. [2024-10-11 02:51:08,806 INFO L78 Accepts]: Start accepts. Automaton has 89457 states and 152122 transitions. Word has length 132 [2024-10-11 02:51:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 89457 states and 152122 transitions. [2024-10-11 02:51:08,814 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, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:51:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 89457 states and 152122 transitions. [2024-10-11 02:51:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 02:51:08,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:08,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:51:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:51:08,898 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash 88983756, now seen corresponding path program 1 times [2024-10-11 02:51:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:08,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784235196] [2024-10-11 02:51:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:51:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:51:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:51:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:51:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:51:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:51:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:51:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:51:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:09,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784235196] [2024-10-11 02:51:09,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784235196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:09,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850922340] [2024-10-11 02:51:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:09,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:51:09,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:51:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:09,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:51:09,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:51:09,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850922340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2024-10-11 02:51:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954247385] [2024-10-11 02:51:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:09,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:51:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:51:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:51:09,988 INFO L87 Difference]: Start difference. First operand 89457 states and 152122 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 8 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 02:51:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:14,415 INFO L93 Difference]: Finished difference Result 178254 states and 308627 transitions. [2024-10-11 02:51:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:51:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 8 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 133 [2024-10-11 02:51:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:15,219 INFO L225 Difference]: With dead ends: 178254 [2024-10-11 02:51:15,219 INFO L226 Difference]: Without dead ends: 178153 [2024-10-11 02:51:15,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2024-10-11 02:51:15,290 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 596 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:15,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 3334 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:51:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178153 states. [2024-10-11 02:51:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178153 to 178128. [2024-10-11 02:51:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178128 states, 147657 states have (on average 1.6105636712109823) internal successors, (237811), 147559 states have internal predecessors, (237811), 30421 states have call successors, (30421), 44 states have call predecessors, (30421), 49 states have return successors, (38070), 30530 states have call predecessors, (38070), 30418 states have call successors, (38070) [2024-10-11 02:51:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178128 states to 178128 states and 306302 transitions. [2024-10-11 02:51:22,848 INFO L78 Accepts]: Start accepts. Automaton has 178128 states and 306302 transitions. Word has length 133 [2024-10-11 02:51:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 178128 states and 306302 transitions. [2024-10-11 02:51:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 8 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-11 02:51:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 178128 states and 306302 transitions. [2024-10-11 02:51:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:51:22,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:22,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:51:23,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 02:51:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:23,198 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -406446873, now seen corresponding path program 1 times [2024-10-11 02:51:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859912917] [2024-10-11 02:51:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:51:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:51:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:51:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:51:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:51:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:51:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:51:23,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:23,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859912917] [2024-10-11 02:51:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859912917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:23,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:51:23,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:51:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014060448] [2024-10-11 02:51:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:23,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:51:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:51:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:51:23,417 INFO L87 Difference]: Start difference. First operand 178128 states and 306302 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:51:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:29,114 INFO L93 Difference]: Finished difference Result 178782 states and 313779 transitions. [2024-10-11 02:51:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:51:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 134 [2024-10-11 02:51:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:30,142 INFO L225 Difference]: With dead ends: 178782 [2024-10-11 02:51:30,142 INFO L226 Difference]: Without dead ends: 178388 [2024-10-11 02:51:30,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:51:30,210 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1074 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:30,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1021 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:51:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178388 states. [2024-10-11 02:51:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178388 to 178214. [2024-10-11 02:51:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178214 states, 147716 states have (on average 1.6104416583173116) internal successors, (237888), 147619 states have internal predecessors, (237888), 30448 states have call successors, (30448), 47 states have call predecessors, (30448), 49 states have return successors, (38099), 30556 states have call predecessors, (38099), 30445 states have call successors, (38099) [2024-10-11 02:51:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178214 states to 178214 states and 306435 transitions. [2024-10-11 02:51:37,717 INFO L78 Accepts]: Start accepts. Automaton has 178214 states and 306435 transitions. Word has length 134 [2024-10-11 02:51:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 178214 states and 306435 transitions. [2024-10-11 02:51:37,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:51:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 178214 states and 306435 transitions. [2024-10-11 02:51:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:51:37,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:37,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 02:51:37,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 02:51:37,852 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:37,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash -328445681, now seen corresponding path program 1 times [2024-10-11 02:51:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691476866] [2024-10-11 02:51:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:51:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:51:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:51:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:51:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:51:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:51:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:51:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:51:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:51:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:51:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:51:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691476866] [2024-10-11 02:51:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691476866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681996310] [2024-10-11 02:51:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:38,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:38,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:51:38,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:51:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:38,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:51:38,545 INFO L278 TraceCheckSpWp]: Computing forward predicates...